Linear resolution for consequence finding
Artificial Intelligence
Experiments with discrimination-tree indexing and path indexing for term retrieval
Journal of Automated Reasoning
A new method for consequence finding and compilation in restricted languages
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Automated Theory Formation in Pure Mathematics
Automated Theory Formation in Pure Mathematics
Journal of Automated Reasoning
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Minimal Answer Computation and SOL
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Model elimination and connection tableau procedures
Handbook of automated reasoning
A completeness theorem and a computer program for finding theorems derivable from given axioms
A completeness theorem and a computer program for finding theorems derivable from given axioms
Limited resource strategy in resolution theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
Induction as Consequence Finding
Machine Learning
Speculative Computation Through Consequence-Finding in Multi-Agent Environments
Annals of Mathematics and Artificial Intelligence
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Consequence finding and computing answers with defaults
Journal of Intelligent Information Systems
AI Communications - CASC
MATHsAiD: A Mathematical Theorem Discovery Tool
SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Theorem proving with structured theories
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Evaluating abductive hypotheses using an EM algorithm on BDDs
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Knowledge based discovery in systems biology using CF-induction
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
A consequence finding approach for full clausal abduction
DS'07 Proceedings of the 10th international conference on Discovery science
Discovering rules by meta-level abduction
ILP'09 Proceedings of the 19th international conference on Inductive logic programming
Hypothesizing about causal networks with positive and negative effects by meta-level abduction
ILP'10 Proceedings of the 20th international conference on Inductive logic programming
Generalizing conjunctive queries for informative answers
FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
DNF hypotheses in explanatory induction
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
Completing causal networks by meta-level abduction
Machine Learning
Hi-index | 0.00 |
SOLAR (SOL for Advanced Reasoning) is a first-order clausal consequence finding system based on the SOL (Skip Ordered Linear) tableau calculus. The ability to find non-trivial consequences of an axiom set is useful in many applications of Artificial Intelligence such as theorem proving, query answering and nonmonotonic reasoning. SOL is a connection tableau calculus which is complete for finding the non-subsumed consequences of a clausal theory. SOLAR is an efficient implementation of SOL that employs several methods to prune away redundant branches of the search space. This paper introduces some of the key pruning and control strategies implemented in SOLAR and demonstrates their effectiveness on a collection of benchmark problems.