Blocking and other enhancements for bottom-up model generation methods

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

Volumn 4130 LNAI, Issue , 2006, Pages 125-139

  Baumgartner, Peter ^a   Schmidt, Renate A ^b  

^a CSIRO   (Australia)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); LIBRARIES; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; REDUNDANCY; THEOREM PROVING;

BOTTOM-UP MODEL GENERATION (BUMG); FIRST-ORDER PROBLEMS; SKOLEM TERMS;

AUTOMATION;

EID: 33749547175     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_11     Document Type: Conference Paper

References (26)

1. F. Baader and U. Sattler. An overview of lableau algorithms for description logics. Studia Logica, 69:5-40, 2001.
2. P. Baumgartner, A. Fuchs, and C. Tinelli. DARWIN, http://goedel.cs.uiowa. edu/Darwin/.
3. P. Baumgartner, U. Furbach, and I. Niemelä. Hyper tableaux. In Proc. JELIA 96, vol. 1126 of LNAI. Springer, 1996.
4. P. Baumgartner, U. Furbach, and F. Stolzenburg. Computing answers with model elimination. Artificial Intelligence, 90(1-2):135-176, 1997.
5. P. Baumgartner und R. A. Schmidt. Blocking and other enhancements for bottom-up model generation methods. Technical report, National ICT Australia, http://www.nicta.com.au/director/research/publications/technical.reports.cfm, 2006.
6. M. Bezem. Disproving distributivity in lattices using geometry logic. In Proc. CADE-20 Workshop on Disproving, 2005.
7. F. Bry and S. Torge. A deduction method complete for refutation and finite satisfiability. In Logics in Artificial Intelligence: JELIA'98, vol. 1489 of LNCS, pp. 1-17. Springer, 1998.
8. F. Bry and A. Yahya. Positive unit hyperresolution tableaux for minimal model generation. J. Automated Reasoning, 25(1):35-82, 2000.
9. K. Claessen and N. Sörensson. New techniques that improve MACE-style finite model building. In Proc. CADE-19 Workshop on Model Computation, 2003.
10. C. Formüller and A. Leitsch. Model building by resolution. In Computer Science Logic: CSL'92, vol. 702 of LNCS, pp. 134-148. Springer, 1993.
11. M. Fujita, J. Slaney, and F. Bennett. Automatic generation of some results in finite algebra. In Proc. IJCAI'95, pp. 52-57. Morgan Kaufmann, 1995.
12. T. Geisler, S. Panne, and H. Schütz. Satchmo: The compiling and functional variants. J. Automated Reasoning, 18(2):227-236, 1997.
13. L. Georgieva, U. Hustadt, and R. A. Schmidt. Computational space efficiency and minimal model generation for guarded formulae. In Logic for Programming, Artificial Intelligence. and Reasoning: LPAR 2001, vol. 2250 of LNAI, pp. 85-99. Springer, 2001.
14. R. Hasegawa, K. Inoue, Y. Ohta, and M. Koshimura. Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving. In Automated Deduction: CADE-14, vol. 1249 of LNCS, pp. 176-190. Springer, 1997.
15. R. Manthey and F. Bry. SATCHMO: a theorem prover implemented in Prolog. In Proc. CADE'88, vol. 310 of LNCS, pp. 415-434. Springer, 1988.
16. W. McCune. A Davis-Putnam Program and its Application to Finite First-Order Model Search: Quasigroup Existence Problems. Technical Report MCS-TM-194, ANL, 1994.
17. W. McCune. Mace4 reference manual and guide. Technical Memorandum 264, Argonne National Laboratory, 2003.
18. R. Nieuwenhuis and A. Rubio. Paramodulation-based theorem proving. In J. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier and MIT Press, 2001.
19. J. A. Robinson. Automatic deduction with hyper-resolution. Internat. J. Computer Math., 1(3):227-234, 1965.
20. R. A. Schmidt. MSPASS. http://www.cs.man.ac.uk/~schmidt/mspass/.
21. R. A. Schmidt and U. Hustadt. Solvability with resolution of problems in the Bernays-Schönfinkel class. Presented at Dagstuhl Seminar 05431 and ARW 2006, Bristol, 2005.
22. J. Slaney. FINDER (finite domain enumerator): Notes and guide. Technical Report TR-ARP-I/92, Australian National University, 1992.
23. M. E. Stickel. Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction. J. Automated Reasoning, 13(2): 189-210, 1994.
24. C. Weidenbach. SPASS. http://spass.mpi-sb.mpg.de.
25. C. Wernhard. System description: KRHyper. In Proc. CADE-19 Workshop on Model Computation: Principles, Algorithms, Applications Systems, 2003.
26. H. Zhang. Sem: a system for enumerating models. In Proc. IJCAI'95, pp. 298-303. Morgan Kaufmann, 1995.