OLD resolution with tabulation
Proceedings on Third international conference on logic programming
Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Negation as failure using tight derivations for general logic programs
Foundations of deductive databases and logic programming
On the declarative and procedual semantics of logic programs
Journal of Automated Reasoning
Every logic program has a natural stratification and an iterated least fixed point model
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A procedural semantics for well founded negation in logic programs
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the power of Alexander templates
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Recursive query processing: the power of logic
Theoretical Computer Science
Well-founded semantics coincides with three-valued stable semantics
Fundamenta Informaticae
WELL!: an evaluation procedure for all logic programs
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Journal of the ACM (JACM)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Magic templates: a spellbinding approach to logic programs
Journal of Logic Programming
Partial evaluation in logic programming
Journal of Logic Programming
Efficient bottom-up computation of queries on stratified databases
Journal of Logic Programming
A procedural semantics for well-founded negation in logic programs
Journal of Logic Programming
The semantics of deductive databases
The semantics of deductive databases
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Query evaluation in deductive databases with alternating fixpoint semantics
ACM Transactions on Database Systems (TODS)
Practical program analysis using general purpose logic programming systems—a case study
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
Recursive query processing using graph traversal techniques
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Computation of Stable Models and Its Integration with Logical Query Processing
IEEE Transactions on Knowledge and Data Engineering
Implementation of Tabled Evaluation with Delaying in Prolog
IEEE Transactions on Knowledge and Data Engineering
Programming with Logical Queries, Bulk Updates, and Hypothetical Reasoning
IEEE Transactions on Knowledge and Data Engineering
On a Tabling Engine That Can Exploit Or-Parallelism
Proceedings of the 17th International Conference on Logic Programming
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Mnesia - A Distributed Robust DBMS for Telecommunications Applications
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Optimization of bound disjunctive queries with constraints
Theory and Practice of Logic Programming
Logic Programming Representation of the Compound Term Composition Algebra
Fundamenta Informaticae
The Life of a Logic Programming System
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Logic programming approach to automata-based decision procedures
ICLP'07 Proceedings of the 23rd international conference on Logic programming
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Rules and logic programming for the web
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Mode-directed fixed point computation
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Theory and Practice of Logic Programming - Prolog Systems
Logic Programming Representation of the Compound Term Composition Algebra
Fundamenta Informaticae
Hi-index | 0.00 |
SLD resolution with negation as finite failure (or SLDNF) reflects the procedural interpretation of Horn-clause predicate logic as a programming language and forms the computational basis for prolog systems. Despite its advantages in memory management, SLDNF is often not appropriate for query evaluation for three reasons; a) it may not terminate due to infinite positive recursion; b) it may not terminate due to infinite recursion through negation; and c) it may repeatedly evaluate the same clause body literal, leading to unacceptable performance.We address all three problems for goal-oriented query evaluation of arbitrary programs by presenting an extension of SLDNF, called SLG resolution, with the following distinctive features:(i) SLG resolution is a partial deduction procedure, consisting of several transformations. Each query is transformed step by step into a set of answer clauses;(ii) SLG resolution is sound and ideally complete for all non-floundering queries with respect to all three-valued stable models (including the well founded partial model);(iii) SLG resolution allows an arbitrary computation rule and an arbitrary control strategy for selecting transformations to apply;(iv) SLG resolution avoids both positive and negative loops and always terminates for programs with the bounded-term-size property;(v) SLG resolution has a polynomial time data complexity for well founded negation.Restricted forms of SLG resolution are identified for definite, locally stratified, and modularly stratified programs, thereby shedding light on the role each transformation plays. To provide answers to a query under different three-valued stable models, SLG resolution can be enhanced by further processing of the derived set of answer clauses.SLG resolution makes many more clausal specifications into effective programs. With simple (user or computer generated) annotations, SLDNF resolution and SLG resolution can be fully integrated. Thus a system including SLG resolution can be fully integrated. Thus a system including SLG resolution is naturally upward compatible with Prolog. For all these reasons we believe that SLG resolution will provide the computational basis for the next generation of logic programming systems.