Journal of Automated Reasoning

, Volume 38, Issue 1–3, pp 57–78 | Cite as

Comparing Instance Generation Methods for Automated Reasoning



The clause-linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of these clauses that can be shown to be propositionally unsatisfiable. In recent years, this approach has been refined in several directions, leading to both tableau-based methods, such as the disconnection tableau calculus, and saturation-based methods, such as primal partial instantiation and resolution-based instance generation. We investigate the relationship between these calculi and answer the question to what extent refutation or consistency proofs in one calculus can be simulated in another one.

Key words

automated reasoning theorem proving disconnection calculus primal partial instantiation resolution-based instance generation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baumgartner, P.: FDPLL – a first-order Davis-Putnam-Logeman-Loveland procedure. In: McAllester, D. (ed.) CADE-17 – The 17th International Conference on Automated Deduction, Pittsburgh, PA, pp. 200–219. (2000)Google Scholar
  2. 2.
    Baumgartner, P., Tinelli, C.: The model evolution calculus. In: Baader, F. (ed.) CADE-19 – The 19th International Conference on Automated Deduction, Miami, Florida, pp. 350–364. (2003)Google Scholar
  3. 3.
    Billon, J.-P.: The disconnection method: a confluent integration of unification in the analytic framework. In: Miglioli, P., Moscato, U., Mundici, D., Ornaghi, M. (eds.) Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, Palermo, Italy, pp. 110–126. (1996)Google Scholar
  4. 4.
    Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5, 201–215 (1962)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: Proc. 18th IEEE Symposium on Logic in Computer Science, pp. 55–64. (2003)Google Scholar
  6. 6.
    Hooker, J.N., Rago, G., Chandru, V., Rivastava, A.: Partial instantiation methods for inference in first-order logic. J. Autom. Reason. 28, 371–396 (2002)MATHCrossRefGoogle Scholar
  7. 7.
    Jacobs, S.: Instance generation methods for automated reasoning. Diploma thesis, Universität des Saarlandes (2004). (Available at
  8. 8.
    Lee, S.-J., Plaisted, D.A.: Eliminating duplication with the hyper-linking strategy. J. Autom. Reason. 13, 25–42 (1992)MathSciNetGoogle Scholar
  9. 9.
    Letz, R., Stenz, G.: Proof and model generation with disconnection tableaux. In: Nieuwenhuis, R., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning: 8th International Conference, Havana, Cuba, pp. 142–156. (2001)Google Scholar
  10. 10.
    Letz, R., Stenz, G.: Generalised handling of variables in disconnection tableaux. In: Basin, D., Rusinowitch, M. (eds.) Automated Reasoning: Second International Joint Conference, Cork, Ireland, pp. 289–306. (2004)Google Scholar
  11. 11.
    Plaisted, D.A., Zhu, Y.: Ordered semantic hyper-linking. J. Autom. Reason. 25, 167–217 (2000)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Stenz, G.: The disconnection calculus. Ph.D. thesis, TU München (2002)Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations