Tabled evaluation with delaying for general logic programs
From MaRDI portal
Publication:4371515
DOI10.1145/227595.227597zbMath0882.68050OpenAlexW2070598037MaRDI QIDQ4371515
Publication date: 19 January 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1996-43/
program transformationslogic programmingquery evaluationstable modelsdeductive databaseswell-founded modelstabled evaluation
Related Items (38)
XSB: Extending Prolog with Tabled Logic Programming ⋮ The language features and architecture of B-Prolog ⋮ An overview of Ciao and its design philosophy ⋮ Precise specification matching for adaptive reuse in embedded systems ⋮ Logic programming with solution preferences ⋮ Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics ⋮ Table space designs for implicit and explicit concurrent tabled evaluation ⋮ Tabling, Rational Terms, and Coinduction Finally Together! ⋮ Incremental Tabling in Support of Knowledge Representation and Reasoning ⋮ Terminating Evaluation of Logic Programs with Finite Three-Valued Models ⋮ Parallel Logic Programming: A Sequel ⋮ Tabling as a library with delimited control ⋮ Tabulation proof procedures for fuzzy linguistic logic programming ⋮ On combining ontologies and rules ⋮ Local closed world reasoning with description logics under the well-founded semantics ⋮ Unnamed Item ⋮ Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation ⋮ An abstract machine for fixed-order dynamically stratified programs ⋮ Dynamic reordering of alternatives for definite logic programs ⋮ Towards multi-threaded local tabling using a common table space ⋮ Efficient tabling of structured data with enhanced hash-consing ⋮ A goal-directed implementation of query answering for hybrid MKNF knowledge bases ⋮ Why-provenance information for RDF, rules, and negation ⋮ Swapping evaluation: A memory-scalable solution for answer-on-demand tabling ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms ⋮ The limits of fixed-order computation ⋮ \(\mho\)-resolution and hybrid knowledge bases ⋮ Loop checks for logic programs with functions ⋮ A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics ⋮ Description, Implementation, and Evaluation of a Generic Design for Tabled CLP ⋮ Parallel backtracking with answer memoing for independent and-parallelism ⋮ Normative Systems Represented as Hybrid Knowledge Bases ⋮ Termination prediction for general logic programs ⋮ Abduction with probabilistic logic programming under the distribution semantics ⋮ Representation sharing for Prolog ⋮ Concurrent and Local Evaluation of Normal Programs ⋮ Generating Specialized Rules and Programs for Demand-Driven Analysis ⋮ Two case studies of semantics execution in Maude: CCS and LOTOS
Uses Software
This page was built for publication: Tabled evaluation with delaying for general logic programs
