Abstract | ||
---|---|---|
To support a large set of rule bases as well as ground facts, we propose an efficient retrieval method by transforming heads of clauses and facts into Concatenated Code Words (CCW) to form a surrogate file. By adopting the ‘mode’ declarations used in PARLOG, the heads of clauses can be represented by function-free terms, and then are transformed to CCW to be used as an index to gain access to the actual database. A simplified unification operation on surrogate files can be efficiently implemented by means of a specialized associative processor due to the uniform structure of surrogate files. |
Year | DOI | Venue |
---|---|---|
1987 | 10.1007/978-1-4613-1679-4_40 | IWDM |
Keywords | Field | DocType |
rule based | Architecture,Content-addressable memory,Programming language,Shared memory,Unification,Computer science,Code word,Concatenation,Artificial intelligence,Logic programming,Parlog | Conference |
Citations | PageRank | References |
3 | 2.03 | 4 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
DongHoon Shin | 1 | 307 | 30.45 |
P. Bruce Berra | 2 | 323 | 196.93 |