SOLAR: A Consequence Finding System for Advanced Reasoning

SOLAR is an efficient first-order consequence finding system based on a connection tableau format with Skip operation. Consequence finding 1,2,3,4 is a generalization of refutation finding or theorem proving, and is useful for many reasoning tasks such as knowledge compilation, inductive logic programming, abduction. One of the most significant calculus of consequence finding is SOL 2. SOL is complete for consequence finding and can find all minimal-length consequences with respect to subsumption. SOLAR (SOL for Advanced Reasoning) is an efficient implementation of SOL and can avoid producing non-minimal/redundant consequences due to various state of the art pruning methods, such as skip-regularity, local failure caching, folding-up (see 5,6).

[1]  William McCune,et al.  OTTER 3.0 Reference Manual and Guide , 1994 .

[2]  Richard C. T. Lee,et al.  Completeness Theorems for Semantic Resolution in Consequence-Finding , 1969, IJCAI.

[3]  Stephen Muggleton,et al.  Developing a Logical Model of Yeast Metabolism , 2001, Electron. Trans. Artif. Intell..

[4]  Sheila A. McIlraith,et al.  Theorem Proving with Structured Theories , 2001, IJCAI.

[5]  Katsumi Inoue,et al.  Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments , 2002, Electron. Notes Theor. Comput. Sci..

[6]  Katsumi Inoue,et al.  Induction, Abduction, and Consequence-Finding , 2001, ILP.

[7]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[8]  W. Bibel,et al.  Automated deduction : a basis for applications , 1998 .

[9]  Laurent Simon,et al.  Efficient Consequence Finding , 2001, IJCAI.

[10]  Alvaro del Val.  A New Method for Consequence Finding and Compilation in Restricted Languages , 1999, AAAI/IAAI.

[11]  Christoph Goller,et al.  Controlled integration of the cut rule into connection tableau calculi , 2004, Journal of Automated Reasoning.

[12]  Raymond Reiter,et al.  A Note on Linear Resolution Strategies in Consequence-Finding , 1972, Artif. Intell..

[13]  William McCune,et al.  Experiments with discrimination-tree indexing and path indexing for term retrieval , 1992, Journal of Automated Reasoning.

[14]  Katsumi Inoue,et al.  Linear Resolution for Consequence Finding , 1992, Artif. Intell..