No label defined (Q3820060)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4092827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4092827 |
Statements
1988
0 references
query answering
0 references
recursive database
0 references
generalized closed world assumption
0 references
hyperresolution
0 references
non-Horn clauses
0 references
theorem proven
0 references
0.7958756685256958
0 references
0.7801581621170044
0 references
0.7791130542755127
0 references
0.7770094871520996
0 references
[For the entire collection see Zbl 0638.00038.] By a recursive database the authors mean a set of clauses without non constant function symbols, containing transitive closure axioms A(x,y)\(\to R(x,y)\) and R(x,y) \& A(y,z)\(\to R(x,z)\). They are interested in goals (queries of the form R(c,d) with constants c,d, as well as in minimal closed positive goals of the form \(C\vee R(c,d)\). The latter corresponds to the possibility of R(c,d) under the generalized closed world assumption. A naive approach would simply generate all positive consequences (they are finite in number) say by hyperresolution and testing for subsumption. The authors provide more sophisticated algorithm based on the graph containing pairs corresponding to all positive A- literals. A query is answered by extracting all paths from this graph, forming the negative clauses from these paths, and sending them together with non-Horn clauses to a theorem proven.
0 references