Chapter

SOLAR: A Consequence Finding System for Advanced Reasoning

10/2003; DOI:10.1007/978-3-540-45206-5_22 pp.257-263
Source: DBLP

ABSTRACT 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).

0 0
 · 
0 Bookmarks
 · 
19 Views
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Keywords

Advanced Reasoning
 
art pruning methods
 
connection tableau format
 
efficient first-order consequence
 
folding-up
 
inductive logic programming
 
knowledge compilation
 
local failure caching
 
minimal-length consequences
 
non-minimal/redundant consequences
 
reasoning tasks
 
skip-regularity
 
various state