Paramodulation Decision Procedures
نویسنده
چکیده
The aim of this thesis is to present Paramodulation Operators deciding the (i) Ackermann class with Equality [FS93] and (ii) the monadic class with equality [BGW93]. Ad (i) a refinement of the Ordered Paramodulation calculus [HR91] is used to define the appropriate inference operator; ad (ii) a variant of the Superposition calculus [BG94] is employed for this purpose. It seemed natural to give a uniform presentation of these underlying equational calculi. Hence, the first part of this thesis is designed to be a uniform treatment of these calculi. In the definition of the paramodulation operator that decides the monadic class with equality ordering constraints are used. Therefor we choose to present all the inference rules that Ordered Paramodulation and Superposition define with respect to ordering constraints. These constraints are used to express the restrictions normally given with the description of an inference rule as part of the object language. Acknowledgments: I wish to thank Univ. Prof. Dr. Alexander Leitsch for the excellent education I received and the bunch of helpful comments that he told me while I was busy with this thesis. Furthermore I wish to thank Univ.-Doz. Dr. Christian Fermüller and Univ.-Ass. Dr. Gernot Salzer for all the ideas and stimulating discussions. For less helpful, but nevertheless stimulating remarks, I wish to thank Alexander, Clark, Julia, Mandana, Richard and Roman.
منابع مشابه
A New Approach to Inferences of Semantic Constraints
Chase procedures are well-known decision and semi-decision procedures for the implication problem among dependencies, a specific type of first-order logic formulas, that are used for expressing database constraints. Of course, the implication problem can also be treated by general refutationally complete inference systems, like resolution with paramodulation. Recently the inference rule of basi...
متن کاملParamodulation without Duplication
The resolution (and paramodulation) inference systems are theorem proving procedures for rst-order logic (with equality), but they can run exponentially long for subclasses which have polynomial time decision procedures, as in the case of SLD resolution and the Knuth-Bendix completion procedure, both in the ground case. Specialized methods run in polynomial time, but have not been extended to t...
متن کاملAutomatic Decidability: A Schematic Calculus for Theories with Counting Operators
Many verification problems can be reduced to a satisfiability problem modulo theories. For building satisfiability procedures the rewriting-based approach uses a general calculus for equational reasoning named paramodulation. Schematic paramodulation, in turn, provides means to reason on the derivations computed by paramodulation. Until now, schematic paramodulation was only studied for standar...
متن کاملDecision Procedures and Model Building in Equational Clause Logic
It is shown that a combination of semantic resolution and ordered paramodulation provides a decision procedure for a large class PVDg of clause sets with equality. It is also demonstrated how the inference system can be transformed into an algorithm that extracts finite descriptions of Herbrand models from sets of clauses. This algorithm always terminates on clause sets in PVDg and yields an ap...
متن کاملParamodulation with Built-in AC-Theories and Symbolic Constraints
Complete paramodulation strategies are developed for clauses with symbolic constraints and built-in associativity and commutativity (AC) properties for a subset of the function symbols. Apart from the reduced search space due to the inherited ordering and uniication restrictions of the inferences (cf. Nieuwenhuis and Rubio, 1995), symbolic constraints turn out to be especially useful in the con...
متن کامل