A Resolution Principle for a Logic with Restricted Quantifiers: 568 (Lecture Notes in Computer Science) - Tapa blanda

B??rckert, Hans-J??rgen

 
9783540550341: A Resolution Principle for a Logic with Restricted Quantifiers: 568 (Lecture Notes in Computer Science)
Tapa blanda
ISBN 10: 3540550348 ISBN 13: 9783540550341
Editorial: Springer, 2008

Sinopsis

This monograph presents foundations for a constrained logic scheme treating constraints as a very general form of restricted quantifiers. The constraints - or quantifier restrictions - are taken from a general constraint system consisting of constraint theory and a set of distinguished constraints. The book provides a calculus for this constrained logic based on a generalization of Robinson’s resolution principle. Technically, the unification procedure of the resolution rule is replaced by suitable constraint-solving methods. The calculus is proven sound and complete for the refutation of sets of constrained clauses. Using a new and elegant generalization of the notion ofa ground instance, the proof technique is a straightforward adaptation of the classical proof technique. The author demonstrates that the constrained logic scheme can be instantiated by well-known sorted logics or equational theories and also by extensions of predicate logics with general equational constraints or concept description languages.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

This monograph presents foundations for a constrained logic scheme treating constraints as a very general form of restricted quantifiers. The constraints - or quantifier restrictions - are taken from a general constraint system consisting of constraint theory and a set of distinguished constraints. The book provides a calculus for this constrained logic based on a generalization of Robinson's resolution principle. Technically, the unification procedure of the resolution rule is replaced by suitable constraint-solving methods. The calculus is proven sound and complete for the refutation of sets of constrained clauses. Using a new and elegant generalization of the notion ofa ground instance, the proof technique is a straightforward adaptation of the classical proof technique. The author demonstrates that the constrained logic scheme can be instantiated by well-known sorted logics or equational theories and also by extensions of predicate logics with general equational constraints or concept description languages.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2008
Idioma
Inglés
ISBN 10 
3540550348
ISBN 13 
9783540550341
Encuadernación
Tapa blanda
Número de páginas
132
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Otras ediciones populares con el mismo título

9780387550343: A Resolution Principle for a Logic With Restricted Quantifiers (Lecture Notes in Computer Science)

Edición Destacada

ISBN 10:  0387550348 ISBN 13:  9780387550343
Editorial: Springer-Verlag, 1991
Tapa blanda