Deduction Systems

This graduate-level text offers a theoretical treatment of the fundamental concepts and methods of automated deduction. By presenting an account which covers resolution theorem-proving in order-sorted first-order logic it provides a self-contained account suitable for students coming to the subject for the first time. Both Gentzen-style sequent calculi and the refutation method known as resolution are treated in detail. Various strategies for pruning resolution search spaces, such as linear, hyper- and ordered resolution are covered. Numerous examples are presented to illustrate the examples discussed. As a result students will find this a readily accessible introduction to this subject.

[1]  Hubert Comon-Lundh,et al.  Equational Formulae with Membership Constraints , 1994, Inf. Comput..

[2]  Alberto Martelli,et al.  An Efficient Unification Algorithm , 1982, TOPL.

[3]  Mike Paterson,et al.  Linear unification , 1976, STOC '76.

[4]  Larry Wos,et al.  Efficiency and Completeness of the Set of Support Strategy in Theorem Proving , 1965, JACM.

[5]  J. A. Robinson,et al.  Automatic Deduction with Hyper-Resolution , 1983 .

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

[7]  Marc Bezem.  Completeness of Resolution Revisited , 1990, Theor. Comput. Sci..

[8]  Harald Ganzinger,et al.  Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract) , 1990, CTRS.

[9]  Michel Bidoit,et al.  A Rehabilitation of Robinson's Unification Algorithm , 1983, IFIP Congress.

[10]  Patricia Johann,et al.  Solving Simplificating Ordering Constraints , 1994 .

[11]  D. Loveland.  A Linear Format for Resolution , 1970 .

[12]  Paliath Narendran,et al.  NP-Completeness of the Set Unification and Matching Problems , 1986, CADE.

[13]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

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

[15]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[16]  R. Kowalski,et al.  Linear Resolution with Selection Function , 1971 .

[17]  Gillier,et al.  Logic for Computer Science , 1986 .

[18]  H. Comon.  Solving Inequations in Term Algebras (Extended Abstract ) , 1990, LICS 1990.