Abstract
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.
This work was partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR 14 AVACS). See www.avacs.org for more information.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baumgartner, P.: FDPLL – A First-Order Davis-Putnam-Logeman-Loveland Procedure. In: McAllester, D. (ed.) CADE 2000. LNCS (LNAI), vol. 1831, pp. 200–219. Springer, Heidelberg (2000)
Billon, J.-P.: The disconnection method: a confluent integration of unification in the analytic framework. In: Miglioli, P., Moscato, U., Ornaghi, M., Mundici, D. (eds.) TABLEAUX 1996. LNCS (LNAI), vol. 1071, pp. 110–126. Springer, Heidelberg (1996)
Baumgartner, P., Tinelli, C.: The model evolution calculus. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 350–364. Springer, Heidelberg (2003)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications ACM 5, 201–215 (1962)
Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: LICS 2003, Ottawa, Canada, pp. 55–64. IEEE, Los Alamitos (2003)
Hooker, J.N., Rago, G., Chandru, V., Rivastava, A.: Partial instantiation methods for inference in first-order logic. Journal of Automated Reasoning 28, 371–396 (2002)
Jacobs, S.: Instance generation methods for automated reasoning. Diploma Thesis, Universität des Saarlandes (2004), Available at http://www.mpi-sb.mpg.de/~sjacobs/publications
Lee, S.-J., Plaisted, D.A.: Eliminating duplication with the hyper-linking strategy. Journal of Automated Reasoning 9, 25–42 (1992)
Letz, R., Stenz, G.: Proof and model generation with disconnection tableaux. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 142–156. Springer, Heidelberg (2001)
Letz, R., Stenz, G.: Generalised handling of variables in disconnection tableaux. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS, vol. 3097, pp. 289–306. Springer, Heidelberg (2004)
Plaisted, D.A.: Ordered semantic hyper-linking. Technical Report MPI-I-94-235, Max-Planck-Institut für Informatik, Saarbrücken, Germany (1994)
Stenz, G.: The Disconnection Calculus. PhD thesis, TU München (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jacobs, S., Waldmann, U. (2005). Comparing Instance Generation Methods for Automated Reasoning. In: Beckert, B. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2005. Lecture Notes in Computer Science(), vol 3702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11554554_13
Download citation
DOI: https://doi.org/10.1007/11554554_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28931-9
Online ISBN: 978-3-540-31822-4
eBook Packages: Computer ScienceComputer Science (R0)