Nested resolution

  • Jonathan Traugott
Special Deduction Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 230)


In this paper we introduce nested resolution, a new nonclausal resolution rule which offers shorter proofs than are possible using conventional nonclausal resolution. Nested resolution also has a local flavor that makes it particularly suitable for parallel implementation. Completeness and soundness proofs are given.


Parallel Implementation Conjunctive Normal Form Ground Instance Original Rule Ground Resolution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [MW1]
    Manna and Waldinger. A deductive approach to program synthesis. ACM Transactions on Programming Languages and Systems, Vol. 2, No 1, 1980.Google Scholar
  2. [MW2]
    Manna and Waldinger, Special relations in automated deduction. Journal of the ACM., Vol 33, No 1, Jan 1986.Google Scholar
  3. [Ma]
    Malachi, Nonclausal logic programming. Ph.D. Thesis. Stanford University. March 1986.Google Scholar
  4. [Mu]
    Murray, Completely non-clausal theorem proving. Artificial Intelligence, Vol 18, 1982.Google Scholar
  5. [Ro]
    Robinson, A machine-oriented logic based on the resolution principle. Journal of the ACM., Vol. 12, No 1, Jan 1965Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Jonathan Traugott
    • 1
  1. 1.Computer Science DepartmentStanford UniversityUSA

Personalised recommendations