Mapetlwane Litha Mokwana
ABSTRACT
The success of resolution-based reasoners in solving set-theoretic problems may well be attributed to the use of heuristics to guide the search for a proof. Often these heuristics are based on different formats of the input formulae, rather than the functionality of the reasoner, e.g. the OTTER theorem prover or its underlying inference mechanism - Resolution. The researchers believe that these heuristics may be applicable to automated reasoning programs implementing different, yet related inference mechanisms. Consequently, research was undertaken to test this hypothesis for a connection tableau-based reasoner. Preliminary investigations confirmed a number of these heuristics to be useful for connection tableau reasoning as implemented by leanCop 2.1. A case study is presented, showing how properties of high level conceptual constructs and knowledge of the given problem domain represented in set theory could be proved using the heuristics.
- Abrial, J., Abrial, J. & Hoare, A. 2005, The B-book: assigning programs to meanings, Cambridge University Press. Google Scholar
Digital Library
- Ahrendt, W., Beckert, B., Hähnle, R., Menzel, W., Reif, W., Schellhorn, G. & Schmitt, P.H. 1998, "Integrating automated and interactive theorem proving",.Google Scholar
- Astrachan, O.L. & Loveland, D.W. 1991, "METEORs: High performance theorem provers using model elimination", Automated Reasoning, pp. 31--59.Google ScholarCross Ref
- Dong, T., Furbach, U., Glöckner, I. & Pelzer, B. 2011, "A natural language question answering system as a participant in human Q&A portals", Proceedings of the Twenty-Second international joint conference on Artificial Intelligence-Volume Volume Three AAAI Press, pp. 2430. Google ScholarDigital Library
- Enderton, H.B. 1977, Elements of set theory, Academic Press.Google Scholar
- Furbach, U. & Obermaier, C. 2007, "Applications of automated reasoning", KI 2006: Advances in Artificial Intelligence, pp. 174--187. Google ScholarDigital Library
- Ibens, O. 2002, "Connection Tableau Calculi with Disjunctive Constraints", Studia Logica, vol. 70, no. 2, pp. 241--270.Google ScholarCross Ref
- Iso, I. 2002, "IEC 13568: 2002: Information technology--Z formal specification notation--Syntax, type system and semantics", ISO (International Organization for Standardization), Geneva, Switzerland,.Google Scholar
- Kaliszyk, C., Urban, J. & Vyskocil, J. 2014, "Certified Connection Tableaux Proofs for HOL Light and TPTP", arXiv preprint arXiv:1410.5476,.Google Scholar
- Korf, R.E. 2010, Artificial intelligence search algorithms, Chapman & Hall/CRC.Google Scholar
- Kovács, L. & Voronkov, A. 2013, "First-order theorem proving and Vampire", Computer Aided Verification Springer, pp. 1. Google ScholarDigital Library
- Letz, R., Schumann, J., Bayerl, S. & Bibel, W. 1992, "Setheo: A high-performance theorem prover", Journal of Automated Reasoning, vol. 8, no. 2, pp. 183--212. Google ScholarDigital Library
- Letz, R. 1998, "Using matings for pruning connection tableaux" in Automated Deduction---CADE-15 Springer, pp. 381--396. Google ScholarDigital Library
- McCune, W. 2003, "Otter 3.3 reference manual", arXiv preprint cs/0310056,.Google Scholar
- Otten, J. 2010, "Restricting backtracking in connection calculi", AI Communications, vol. 23, no. 2, pp. 159--182. Google ScholarDigital Library
- Plaisted, D.A. & Greenbaum, S. 1986, "A structure-preserving clause form translation", Journal of Symbolic Computation, vol. 2, no. 3, pp. 293--304. Google ScholarDigital Library
- Quaife, A. 1992, "Automated deduction in von Neumann-Bernays-Gödel set theory", Journal of Automated Reasoning, vol. 8, no. 1, pp. 91--147. Google ScholarDigital Library
- Reinefeld, A. & Marsland, T.A. 1994, "Enhanced iterative-deepening search", Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 16, no. 7, pp. 701--710. Google ScholarDigital Library
- Schulz, S. 2002, "E-a brainiac theorem prover", Ai Communications, vol. 15, no. 2, pp. 111--126. Google ScholarDigital Library
- Spivey, J.M. 1989, "An introduction to Z and formal specifications", Software Engineering Journal, vol. 4, no. 1, pp. 40--50. Google ScholarDigital Library
- Steyn, P.S. 2009, Validating reasoning heuristics using next generation theorem provers,.Google Scholar
- Sutcliffe, G. & Melville, S. 1996, "The Practice of Clausification in Automatic Theorem Proving", South African Computer Journal, pp. 57--68.Google Scholar
- Sutcliffe, G. 2013, "The 6 th IJCAR automated theorem proving system competition CASC-J 6", AI Communications, vol. 26, no. 2, pp. 211--223. Google ScholarDigital Library
- Sutcliffe, G. 2009, "The TPTP problem library and associated infrastructure", Journal of Automated Reasoning, vol. 43, no. 4, pp. 337--362. Google ScholarDigital Library
- van der Poll, J.A., Kotze, P. & Labuschagne, W.A. 2004, "Automated Support for Enterprise Information Systems", Journal of Universal Computer Science, vol. 10, no. 11, pp. 1519--1539.Google Scholar
- Weidenbach, C., Dimova, D., Fietzke, A., Kumar, R., Suda, M. & Wischnewski, P. 2009, "SPASS Version 3.5" in Automated Deduction--CADE-22 Springer, pp. 140--145. Google ScholarDigital Library
Recommendations
Formalization of the Resolution Calculus for First-Order Logic
I present a formalization in Isabelle/HOL of the resolution calculus for first-order logic with formal soundness and completeness proofs. To prove the calculus sound, I use the substitution lemma, and to prove it complete, I use Herbrand interpretations ...
Certified Connection Tableaux Proofs for HOL Light and TPTP
CPP '15: Proceedings of the 2015 Conference on Certified Programs and ProofsIn recent years, the Metis prover based on ordered paramodulation and model elimination has replaced the earlier built-in methods for general-purpose proof automation in HOL4 and Isabelle/HOL. In the annual CASC competition, the leanCoP system based on ...
Restricting backtracking in connection calculi
Practical Aspects of Automated ReasoningConnection calculi benefit from a goal-oriented proof search, but are in general not proof confluent. A substantial amount of backtracking is required, which significantly affects the time complexity of the proof search. This paper presents a simple ...
Comments