Hans-Jürgen Bürckert

A Resolution Principle for a Logic with Restricted Quantifiers

• Broschiertes Buch

Produktbeschreibung

This monograph presents foundations for a constrainedlogic scheme treating constraints as a very general form ofrestricted quantifiers. The constraints - or quantifierrestrictions - are taken from a general constraint systemconsisting of constraint theory and a set of distinguishedconstraints.The book provides a calculus for this constrained logicbased on a generalization of Robinson's resolutionprinciple. Technically, the unification procedure of theresolution rule is replaced by suitable constraint-solvingmethods. The calculus is proven sound and complete for therefutation of sets of constrained clauses. Using a new andelegant generalization of the notion ofa ground instance,the proof technique is a straightforward adaptation of theclassical proof technique.The author demonstrates that the constrained logic schemecan be instantiated by well-known sorted logics orequational theories and also by extensions of predicatelogics with general equational constraints or conceptdescription languages.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 568
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-55034-1
• 1991.
• Seitenzahl: 132
• Erscheinungstermin: 11. Dezember 1991
• Englisch
• Abmessung: 235mm x 155mm x 8mm
• Gewicht: 230g
• ISBN-13: 9783540550341
• ISBN-10: 3540550348
• Artikelnr.: 09229055

Inhaltsangabe

Preliminaries.- Unification.- A logic with restricted quantifiers.- Equational constraint theories.- Conclusion.