9783540550341 - A Resolution Principle for a Logic with Restricted Quantifiers: 568 Lecture Notes in Computer Science, 568 by Bürckert, Hans-jürgen (12 results)

Paperback. Condition: Very Good. 0387550348 Ex-library paperback in very nice condition with the usual markings and attachments.

Softcover. Condition: Très bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Salissures sur la tranche. Edition 1991. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Stains on the edge. Edition 1991. Ammareal gives back up to 15% of this item's net price to charity organizations.

Condition: New.

Condition: New. In.

PF. Condition: New.

Condition: New. pp. 132.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 132 pp. Englisch.

Condition: New. PRINT ON DEMAND pp. 132.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 c.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 instancethe 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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 132 pp. Englisch.

Taschenbuch. Condition: Neu. A Resolution Principle for a Logic with Restricted Quantifiers | Hans-Jürgen Bürckert | Taschenbuch | xii | Englisch | 1991 | Springer | EAN 9783540550341 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.