Efficient top-down computation of queries under the well-founded semantics
From MaRDI portal
Publication:3125898
DOI10.1016/0743-1066(94)00028-5zbMath0866.68017OpenAlexW2026433347MaRDI QIDQ3125898
Weidong Chen, Terrance Swift, David S. Warren
Publication date: 6 July 1997
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(94)00028-5
Related Items
Termination of logic programs with imperfect information: applications and query procedure, Compacting Boolean Formulae for Inference in Probabilistic Logic Programming, Logic programming with solution preferences, Disjunctive logic and semantics of disjunctive logic programs, An abstract machine for fixed-order dynamically stratified programs, Dynamic reordering of alternatives for definite logic programs, Enhancing global SLS-resolution with loop cutting and tabling mechanisms, A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics, A rule based knowledge transaction model for mobile environments, Probabilistic reasoning with answer sets, Nonmonotonic Trust Management for P2P Applications, Integrating answer set programming and constraint logic programming, Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics, Logic programming and knowledge representation---The A-Prolog perspective
Uses Software
