Name
Abstract | ||
|---|---|---|
This paper presents an improvement of A-SATCHMORE (SATCHMORE with Availability). A-SATCHMORE incorporates relevancy testing and availability checking into SATCHMO to prune away irrelevant forward chaining. However, considering every consequent atom of those non-Horn clauses being derivable, A-SATCHMORE may suffer from a potential explosion of the search space when some of such consequent atoms are actually underivable. This paper introduces a solution for this problem and shows its correctness. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/BF02948883 | J. Comput. Sci. Technol. |
Keywords | Field | DocType |
non-horn clause,search space,potential explosion,consequent atom,relevancy testing,irrelevant forward chaining,availability checking,theorem proving,forward chaining,availability | Forward chaining,Computer science,Correctness,Automated theorem proving,Algorithm,Theoretical computer science,Distributed computing | Journal |
Volume | Issue | ISSN |
18 | 2 | 1860-4749 |
Citations | PageRank | References |
2 | 0.38 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lifeng He | 1 | 441 | 40.97 |
| Yuyan Chao | 2 | 315 | 24.07 |
| Tsuyoshi Nakamura | 3 | 18 | 8.61 |
| Hidenori Itoh | 4 | 368 | 252.31 |