Complexity analysis of propositional resolution with autarky pruning

Discrete Applied Mathematics

Volumn 96-97, Issue , 1999, Pages 195-221

  Van Gelder, Allen ^a  

^a University of California Santa Cruz   (United States)

Author keywords

Autarky; Boolean formula; Model; Model elimination; Propositional formula; Refutation; Resolution; Satisfiability

Indexed keywords

EID: 0042598801     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00040-2     Document Type: Article

References (14)

1. M. Davis, G. Logemann, D. Loveland, A machine program for theorem-proving, Commun. ACM 5 (1962) 394-397.
2. F. Giunchiglia, R. Sebastiani, Building decision procedures for modal logics from prepositional decision procedures - the case study of modal K, In thirteenth International Conference on Automated Deduction, Springer, Berlin, 1996, pp. 583-597.
3. R. Kowalski, D. Kuehner, Linear resolution with selection function, Artif. Intell. 2(2/3) (1971) 227-260.
4. O. Kullmann, New methods for 3-SAT decision and worst-case analysis, Theor. Comp. Science (1999) (to appear, preprint at . . .
5. R. Letz, K. Mayr, C. Goller, Controlled integration of the cut rule into connection tableau calculi, J. Automat. Reason. 13(3) (1994) 297-337.
6. D.W. Loveland, A simplified format for the model elimination theorem-proving procedure, J. Assoc. Comput. Mach. 16(3) (1969) 349-363.
7. D.W. Loveland, A unifying view of some linear Herbrand procedures, J. Assoc. Comput. Mach. 19 (2) (1972) 366-384.
8. n steps, Discrete Appl. Math. 10 (1985) 287-295.
9. J. Minker, G. Zanon, An extension to linear resolution with selection function, Inform. Process. Lett. 14(3) (1982) 191-194.
10. D.A. Plaisted, The search efficiency of theorem proving strategies, In twelth International Conference on Automated Deduction, Springer, Berlin, 1994, pp. 57-71.
11. n steps, In sixth Workshop on Computer Science Logic, Berlin, Germany, 1992, Springer, Berlin, pp. 379-394.
12. A. Urquhart, Hard examples for resolution, J. Assoc. Comput. Mach. 34 (1) (1987) 209-219.
13. A. Van Gelder, Autarky pruning in prepositional model elimination reduces failure redundancy, Journal of Automated Reasoning, 1999 (to appear, preprint at ftp://ftp.cse.ucsc.edu/pub/avg/JAR/aut-jar-dist.ps.Z).
14. A. Van Gelder, F. Okushi, Lemma and cut strategies for prepositional model elimination. Annals of Mathematics and Artificial Intelligence, 1999 (to appear, preprint at ftp://ftp.cse.ucsc.edu/pub/avg/ AMAI/lemmas-dist.ps.Z).