---

＜電子ブック＞
A Resolution Principle for a Logic with Restricted Quantifiers / by Hans-Jürgen Bürckert
(Lecture Notes in Artificial Intelligence. ISSN:29459141 ; 568)

版	1st ed. 1991.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1991
本文言語	英語
大きさ	XII, 120 p : online resource
著者標目	*Bürckert, Hans-Jürgen author SpringerLink (Online service)
件　名	LCSH:Computer science LCSH:Artificial intelligence LCSH:Machine theory LCSH:Mathematical logic FREE:Theory of Computation FREE:Artificial Intelligence FREE:Formal Languages and Automata Theory FREE:Mathematical Logic and Foundations
一般注記	Preliminaries -- Unification -- A logic with restricted quantifiers -- Equational constraint theories -- Conclusion 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 HTTP:URL=https://doi.org/10.1007/3-540-55034-8

 類似資料