A Resolution Principle for Clauses with Constraints

We introduce a general scheme for handling clauses whose variables are constrained by an underlying constraint theory. In general, constraints can be seen as quantifier restrictions as they filter out the values that can be assigned to the variables of a clause (or an arbitrary formulae with restricted universal or existential quantifier) in any of the models of the constraint theory. We present a resolution principle for clauses with constraints, where unification is replaced by testing constraints for satisfiability over the constraint theory. We show that this constrained resolution is sound and complete in that a set of clauses with constraints is unsatisfiable over the constraint theory iff we can deduce a constrained empty clause for each model of the constraint theory, such that the empty clauses constraint is satisfiable in that model. We show also that we cannot require a better result in general, but we discuss certain tractable cases, where we need at most finitely many such empty clauses or even better only one of them as it is known in classical resolution, sorted resolution or resolution with theory unification.

[1]  Alan M. Frisch.  A General Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning , 1989, International Conference on Principles of Knowledge Representation and Reasoning.

[2]  José Meseguer,et al.  Equality, Types, Modules and Generics for Logic Programming , 1984, ICLP.

[3]  Jean H. Gallier,et al.  SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification , 1986, SLP.

[4]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[5]  Gert Smolka.  Logic Programming over Polymorphically Order-Sorted Types , 1989 .

[6]  M. Schmidt-Schauβ.  Computational Aspects of an Order-Sorted Logic with Term Declarations , 1989 .

[7]  李幼升,et al.  Ph , 1989 .

[8]  Michael R. Genesereth,et al.  Logical foundations of artificial intelligence , 1987 .

[9]  J. Goguen,et al.  Order-Sorted Equational Computation , 1989 .

[10]  Christoph Walther,et al.  A Many-Sorted Calculus Based on Resolution and Paramodulation , 1982, IJCAI.

[11]  Maurice Nivat,et al.  Resolution of Equations in Algebraic Structures , 1989 .

[12]  Hans Jürgen Ohlbach.  The Semantic Clause Graph Procedure - A First Overview , 1986, GWAI.

[13]  Ronald J. Brachman,et al.  An Overview of the KL-ONE Knowledge Representation System , 1985, Cogn. Sci..

[14]  Gérard Huet,et al.  Constrained resolution: a complete method for higher-order logic. , 1972 .

[15]  Hans-Jürgen Bürckert,et al.  A Resolution Principle for a Logic with Restricted Quantifiers , 1991, Lecture Notes in Computer Science.

[16]  Arnold Oberschelp.  Untersuchungen zur mehrsortigen Quantorenlogik , 1962 .

[17]  Jörg H. Siekmann.  Unification Theory , 1989, J. Symb. Comput..

[18]  George A. Robinson,et al.  Paramodulation and set of support , 1970 .

[19]  Hans-Jürgen Bürckert.  Solving Disequations in Equational Theories , 1988, CADE.

[20]  Hans-Jürgen Bitrckert.  Lazy Theory Unification in Prolog: An Extension of the Warren Abstract Machine , 1986 .

[21]  Bernhard Nebel,et al.  Reasoning and Revision in Hybrid Representation Systems , 1990, Lecture Notes in Computer Science.

[22]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[23]  Keith L. Clark,et al.  Logic Programming Schemes , 1988, FGCS.

[24]  Gert Smolka,et al.  Logic Programming with Polymorphically Order-Sorted Types , 1988, ALP.

[25]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[26]  Christoph Walther,et al.  Many-Sorted Resolution and Paramodulation , 1987 .

[27]  Werner Stein,et al.  Indexing principles for relational languages applied to PROLOG code generation , 1992 .

[28]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[29]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[30]  Gert Smolkaz,et al.  Deenite Relations over Constraint Languages , 1988 .

[31]  Manfred Schmidt-Schauß,et al.  Computational Aspects of an Order-Sorted Logic with Term Declarations , 1989, Lecture Notes in Computer Science.

[32]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[33]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[34]  Alain Colmerauer,et al.  Equations and Inequations on Finite and Infinite Trees , 1984, FGCS.

[35]  Pascal Van Hentenryck,et al.  The Constraint Logic Programming Language CHIP , 1988, FGCS.

[36]  José Meseguer,et al.  Equality, Types, Modules, and (Why not ?) Generics for Logic Programming , 1984, J. Log. Program..

[37]  Jean-Pierre Bourguignon,et al.  Mathematische Annalen , 1893 .