Ordered Resolution with Straight Dismatching Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Ordered Resolution with Straight Dismatching Constraints

Résumé

We present a sound and complete ordered resolution calculus for first-order clauses with straight dismatching constraints. The extended clause language is motivated by our first-order theorem proving approach through approximation and refinement. Using a clause language with straight dismatching constraints, single refinement steps do not result in a worst-case quadratic blowup in the number of clauses anymore. The refinement steps can now be represented by replacing one input clause with two equivalent clauses. We show soundness and completeness of ordered resolution with straight dismatching constraints. All needed operations on straight dismatching constraints take linear or linear logarithmic time in the size of the constraint.
Fichier principal
Vignette du fichier
paar.pdf (300.29 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01403206 , version 1 (28-11-2016)

Identifiants

  • HAL Id : hal-01403206 , version 1

Citer

Andreas Teucke, Christoph Weidenbach. Ordered Resolution with Straight Dismatching Constraints. 5th Workshop on Practical Aspects of Automated Reasoning (PAAR 2016), 2016, Coimbra, Portugal. pp.95-109. ⟨hal-01403206⟩
129 Consultations
20 Téléchargements

Partager

Gmail Facebook X LinkedIn More