Abstract
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.
Translated title of the contribution | SOLAR: An automated deduction system for consequence finding |
---|---|
Original language | English |
Article number | 183-203 |
Journal | AI Communications |
Volume | 23 |
Issue number | 2-3 |
DOIs | |
Publication status | Published - 2010 |