LEADER 03524nam  22006135  450 
001 996465320303316
005 20200705034322.0
010   $a3-540-46670-3
024 7 $a10.1007/3-540-55034-8
035   $a(CKB)1000000000233761
035   $a(SSID)ssj0000326274
035   $a(PQKBManifestationID)11242582
035   $a(PQKBTitleCode)TC0000326274
035   $a(PQKBWorkID)10296572
035   $a(PQKB)11086174
035   $a(DE-He213)978-3-540-46670-3
035   $a(PPN)155187414
035   $a(EXLCZ)991000000000233761
100   $a20121227d1991      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 12$aA Resolution Principle for a Logic with Restricted Quantifiers$b[electronic resource] /$fby Hans-Jürgen Bürckert
205   $a1st ed. 1991.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1991.
215   $a1 online resource (XII, 120 p.) 
225 1 $aLecture Notes in Artificial Intelligence ;$v568
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-55034-8 
327   $aPreliminaries -- Unification -- A logic with restricted quantifiers -- Equational constraint theories -- Conclusion.
330   $aThis 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.
410  0$aLecture Notes in Artificial Intelligence ;$v568
606   $aComputers
606   $aArtificial intelligence
606   $aMathematical logic
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005
615  0$aComputers.
615  0$aArtificial intelligence.
615  0$aMathematical logic.
615 14$aTheory of Computation.
615 24$aArtificial Intelligence.
615 24$aMathematical Logic and Formal Languages.
615 24$aMathematical Logic and Foundations.
676   $a006.3
700   $aBürckert$b Hans-Jürgen$4aut$4http://id.loc.gov/vocabulary/relators/aut$0545511
906   $aBOOK
912   $a996465320303316
996   $aResolution principle for a logic with restricted quantifiers$9888385
997   $aUNISA