Labelled Splitting

  • Arnaud Fietzke
  • Christoph Weidenbach
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5195)


We define a superposition calculus with explicit splitting and an explicit, new backtracking rule on the basis of labelled clauses. For the first time we show a superposition calculus with explicit backtracking rule sound and complete. The new backtracking rule advances backtracking with branch condensing known from Spass. An experimental evaluation of an implementation of the new rule shows that it improves considerably the previous Spass splitting implementation. Finally, we discuss the relationship between labelled first-order splitting and DPLL style splitting with intelligent backtracking and clause learning.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7, 201–215 (1960)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: From an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL. Journal of the ACM 53, 937–977 (2006)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Bachmair, L., Ganzinger, H., Waldmann, U.: Superposition with simplification as a decision procedure for the monadic class with equality. In: Gottlob, G., Leitsch, A., Mundici, D. (eds.) KGC 1993. LNCS, vol. 713, pp. 83–96. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  4. 4.
    Weidenbach, C., Gaede, B., Rock, G.: Spass & flotter, version 0.42. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol. 1104, pp. 141–145. Springer, Heidelberg (1996)Google Scholar
  5. 5.
    Weidenbach, C.: Combining superposition, sorts and splitting. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 2, pp. 1965–2012. Elsevier, Amsterdam (2001)CrossRefGoogle Scholar
  6. 6.
    Fietzke, A., Weidenbach, C.: Labelled splitting. Research Report MPI-I-2008-RG1-001, Max-Planck Institute for Informatics, Saarbruecken, Germany (2008)Google Scholar
  7. 7.
    Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)Google Scholar
  8. 8.
    Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Handbook of Automated Reasoning, pp. 19–99 (2001)Google Scholar
  9. 9.
    Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, pp. 371–443. Elsevier, Amsterdam (2001)CrossRefGoogle Scholar
  10. 10.
    Weidenbach, C., Schmidt, R., Hillenbrand, T., Rusev, R., Topic, D.: System description: SPASS version 3.0. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 514–520. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    Sutcliffe, G., Suttner, C.B.: The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning 21(2), 177–203 (1998)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Riazanov, A., Voronkov, A.: Splitting without backtracking. In: IJCAI, pp. 611–617 (2001)Google Scholar
  13. 13.
    Basin, D., D’Agostino, M., Gabbay, D.M., Matthews, S., Viganó, L. (eds.): Labelled deduction. Kluwer Academic Publishers, Dordrecht (2000)MATHGoogle Scholar
  14. 14.
    Lev-Ami, T., Weidenbach, C., Reps, T., Sagiv, M.: Labelled clauses. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 311–327. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  15. 15.
    Eén, N., Sörensson, N.: An extensible SAT solver. Theory and Applications of Satisfiability Testing, 502–518 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Arnaud Fietzke
    • 1
  • Christoph Weidenbach
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrücken

Personalised recommendations