Lightweight relevance filtering for machine-generated resolution problems

Journal of Applied Logic

Volumn 7, Issue 1, 2009, Pages 41-57

  Meng, Jia ^a   Paulson, Lawrence C ^b  

^a CSIRO   (Australia)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Automated reasoning; Interactive theorem proving; Proving in large theories; Relevance filtering

Indexed keywords

AUTOMATA THEORY; OPEN SYSTEMS; PROBLEM SOLVING; PROGRAMMING THEORY;

AUTOMATED REASONING; INTERACTIVE THEOREM PROVING; ISABELLE; PROVING IN LARGE THEORIES; RELEVANCE FILTERING; SEARCH SPACES; SUCCESS RATES;

THEOREM PROVING;

EID: 58549087405     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2007.07.004     Document Type: Article

References (26)

1. Ahrendt W., Beckert B., Hähnle R., Menzel W., Reif W., Schellhorn G., and Schmitt P.H. Integrating automated and interactive theorem proving. In: Bibel W., and Schmitt P.H. (Eds). Automated Deduction-A Basis for Applications, vol. II. Systems and Implementation Techniques (1998), Kluwer Academic Publishers 97-116
2. J. Avigad, K. Donnelly, Formalizing O notation in Isabelle/HOL, in: Basin and Rusinowitch [4], pp. 357-371
3. L. Bachmair, H. Ganzinger, Resolution theorem proving, in: Robinson and Voronkov [18], pp. 19-99, Chapter 2
4. In: Basin D., and Rusinowitch M. (Eds). Automated Reasoning-Second International Joint Conference, IJCAR 2004. LNAI vol. 3097 (2004), Springer
5. Bezem M., Hendriks D., and de Nivelle H. Automatic proof construction in type theory using resolution. Journal of Automated Reasoning 29 3-4 (2002) 253-275
6. Condor: High throughput computing. http://www.cs.wisc.edu/condor/
7. Fuchs M., and Fuchs D. Abstraction-based relevancy testing for model elimination. In: Ganzinger H. (Ed). Automated Deduction-CADE-16 International Conference. LNAI vol. 1632 (1999), Springer 344-358
8. J. Meng, L.C. Paulson, Experiments on supporting interactive proof using resolution, in: Basin and Rusinowitch [4], pp. 372-384
9. J. Meng, L.C. Paulson, Translating higher-order problems to first-order clauses, in: G. Sutcliffe, R. Schmidt, S. Schulz (Eds.), FLoC'06 Workshop on Empirically Successful Computerized Reasoning, CEUR Workshop Proceedings, vol. 192, 2006, pp. 70-80
10. Meng J., Quigley C., and Paulson L.C. Automation for interactive proof: First prototype. Information and Computation 204 10 (2006) 1575-1596
11. Paulson L.C. Generic automatic proof tools. In: Veroff R. (Ed). Automated Reasoning and its Applications: Essays in Honor of Larry Wos (1997), MIT Press (Chapter 3)
12. Paulson L.C. The inductive approach to verifying cryptographic protocols. Journal of Computer Security 6 1-2 (1998) 85-128
13. Paulson L.C. A generic tableau prover and its integration with Isabelle. Journal of Universal Computer Science 5 3 (1999) 73-87
14. Paulson L.C. Relations between secrets: Two formal analyses of the Yahalom protocol. Journal of Computer Security 9 3 (2001) 197-216
15. Plaisted D.A., and Yahya A. A relevance restriction strategy for automated deduction. Artificial Intelligence 144 1-2 (2003) 59-93
16. Reif W., and Schellhorn G. Theorem proving in large theories. In: Bibel W., and Schmitt P.H. (Eds). Automated Deduction-A Basis for Applications, vol. III. Applications (1998), Kluwer Academic Publishers 225-240
17. Riazanov A., and Voronkov A. The design and implementation of VAMPIRE. AI Communications 15 2 (2002) 91-110
18. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning (2001), Elsevier Science
19. Robinson J.A. A machine-oriented logic based on the resolution principle. Journal of the ACM 12 (1965) 23-41
20. S. Schulz, System description: E 0.81, in: Basin and Rusinowitch [4], pp. 223-228
21. Siekmann J., Benzmüller C., Fiedler A., Meier A., Normann I., and Pollet M. Proof development with Ωmega: The irrationality of sqrt(2). In: Kamareddine F. (Ed). Thirty Five Years of Automating Mathematics (2003), Kluwer Academic Publishers 271-314
22. Sutcliffe G., and Dvorsky A. Proving harder theorems by axiom reduction. In: Russell I., and Haller S. (Eds). Proceedings of the Sixteenth International Florida Artificial Intelligence Research Society Conference (2003), AAAI Press 108-113
23. Sutcliffe G., and Suttner C. CASC-20: The CADE ATP system competition. http://www.cs.miami.edu/~tptp/CASC/20/
24. Sutcliffe G., and Suttner C. The TPTP problem library: CNF Release v1.2.1. Journal of Automated Reasoning 21 2 (1998) 177-203
25. C. Weidenbach, Combining superposition, sorts and splitting, in: Robinson and Voronkov [18], pp. 1965-2013, Chapter 27
26. Wos L., Robinson G.A., and Carson D.F. Efficiency and completeness of the set of support strategy in theorem proving. Journal of the ACM 12 4 (1965) 536-541