Skip to Main content Skip to Navigation
Conference papers

Ordered Resolution with Straight Dismatching Constraints

Andreas Teucke 1 Christoph Weidenbach 2, 1
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est, MPII - Max-Planck-Institut für Informatik
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Stephan Merz Connect in order to contact the contributor
Submitted on : Monday, November 28, 2016 - 4:53:35 PM
Last modification on : Wednesday, November 3, 2021 - 7:57:37 AM
Long-term archiving on: : Tuesday, March 21, 2017 - 9:42:59 AM


Publisher files allowed on an open archive


  • HAL Id : hal-01403206, version 1



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⟩



Les métriques sont temporairement indisponibles