Name
Abstract | ||
|---|---|---|
Consequence finding has been recognized as an important technique in many intelligent systems involving inference. In previous work, propositional or first-order clausal theories have been considered for consequence finding. In this paper, we consider consequence finding from a default theory, which consists of a first-order clausal theory and a set of normal defaults. In an extension of a default theory, consequence finding can be done with the generating defaults for the extension. Alternatively, all extensions can be represented at once with the conditional answer format, which represents how a conclusion depends on which defaults.We also propose a procedure for consequence finding and query answering in a default theory using the first-order consequence-finding procedure SOL. In computing consequences from default theories efficiently, the notion of TCS-freeness is most important to prune a large number of irrational tableaux induced by the generating defaults for an extension. In order to simulate the TCS-freeness, the refined SOL calculus called SOL-S(驴) is adopted using skip preference and complement checking. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s10844-006-5450-2 | Journal of Intelligent Information Systems |
Keywords | Field | DocType |
Consequence finding,Conditional answers,Default theory | Intelligent decision support system,Computer science,Inference,Algorithm,Theoretical computer science,Irrational number,Default,Artificial intelligence,Machine learning | Journal |
Volume | Issue | ISSN |
26 | 1 | 0925-9902 |
Citations | PageRank | References |
7 | 0.52 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Katsumi Inoue | 1 | 1271 | 112.78 |
| Koji Iwanuma | 2 | 138 | 17.65 |
| Hidetomo Nabeshima | 3 | 154 | 14.88 |