SOLAR: An automated deduction system for consequence finding
| Autor: | Katsumi Inoue, Oliver Ray, Hidetomo Nabeshima, Koji Iwanuma |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
Theoretical computer science
Computer science First-order logic Set (abstract data type) Automated theorem proving TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Artificial Intelligence Computer Science::Logic in Computer Science Benchmark (computing) Pruning (decision trees) Applications of artificial intelligence Non-monotonic logic Algorithm Axiom |
| Zdroj: | AI Communications. 23:183-203 |
| ISSN: | 0921-7126 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|