Labelled splitting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5195 LNAI, Issue , 2008, Pages 459-474

  Fietzke, Arnaud ^a   Weidenbach, Christoph ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED REASONING; BACKTRACKING RULE; CLAUSE LEARNING; EXPERIMENTAL EVALUATIONS; FIRST ORDERS; JOINT CONFERENCE; SUPERPOSITION CALCULUS;

AUTOMATA THEORY; DIFFERENTIATION (CALCULUS); MATHEMATICAL TECHNIQUES;

LAWS AND LEGISLATION;

EID: 53049088875     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71070-7_39     Document Type: Conference Paper

References (15)

1. Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7, 201-215 (1960)
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)
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)
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)
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)
6. Fietzke, A., Weidenbach, C.: Labelled splitting. Research Report MPI-I-2008-RG1-001, Max-Planck Institute for Informatics, Saarbruecken, Germany (2008)
7. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
8. Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Handbook of Automated Reasoning, pp. 19-99 (2001)
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)
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)
11. Sutcliffe, G., Suttner, C.B.: The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning 21(2), 177-203 (1998)
12. Riazanov, A., Voronkov, A.: Splitting without backtracking. In: IJCAI, pp. 611-617 (2001)
13. Basin, D., D'Agostino, M., Gabbay, D.M., Matthews, S., Viganó, L. (eds.): Labelled deduction. Kluwer Academic Publishers, Dordrecht (2000)
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)
15. Eén, N., Sörensson, N.: An extensible SAT solver. Theory and Applications of Satisfiability Testing, 502-518 (2004)