Abstract
We present a new technique for computing the well-founded semantics for constraint extensions of Datalog¬. The method is based on tabulated resolution enhanced with a new refinement strategy for deriving negative conclusions. This approach leads to an efficient and terminating query evaluation algorithm that preserves the goal-oriented nature of the resolution based methods.
Cite
CITATION STYLE
Toman, D. (1996). Computing the well-founded semantics for constraint extensions of datalog¬. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1191, pp. 64–79). Springer Verlag. https://doi.org/10.1007/3-540-62501-1_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
