OLD resolution with tabulation
Proceedings on Third international conference on logic programming
Memory performance of prolog architectures
Memory performance of prolog architectures
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Negation as failure using tight derivations for general logic programs
Journal of Logic Programming
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
Recursive query processing: the power of logic
Theoretical Computer Science
Introduction to algorithms
Warren's abstract machine: a tutorial reconstruction
Warren's abstract machine: a tutorial reconstruction
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Can logic programming execute as fast as imperative programming?
Can logic programming execute as fast as imperative programming?
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Modular stratification and magic sets for Datalog programs with negation
Journal of the ACM (JACM)
Analysis of SLG-WAM evaluation of definite programs
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Efficient evaluation of normal logic programs
Efficient evaluation of normal logic programs
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
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
Implementation of Tabled Evaluation with Delaying in Prolog
IEEE Transactions on Knowledge and Data Engineering
CORAL - Control, Relations and Logic
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Beyond Depth-First: Improving Tabled Logic Programs through Alternative Scheduling Strategies
PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
The Limits of Fixed-Order Computation
LID '96 Proceedings of the International Workshop on Logic in Databases
Or-Parallel Execution Models of Prolog
TAPSOFT '87 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Functional and Logic Programming and Specifications (CFLP)
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Extension tables for recursive query evaluation
Extension tables for recursive query evaluation
Memory management for Prolog with tabling
Proceedings of the 1st international symposium on Memory management
Tabling for non-monotonic programming
Annals of Mathematics and Artificial Intelligence
SLT-Resolution for the Well-Founded Semantics
Journal of Automated Reasoning
A New Formulation of Tabled Resolution with Delay
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Proceedings of the 17th International Conference on Logic Programming
On a Tabling Engine That Can Exploit Or-Parallelism
Proceedings of the 17th International Conference on Logic Programming
A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Achieving Scalability in Parallel Tabled Logic Programs
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
CHAT: The Copy-Hybrid Approach to Tabling
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Implementation of a Linear Tabling Mechanism
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
Heap Garbage Collection in XSB: Practice and Experience
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
Suspending and Resuming Computations in Engines for SLG Evaluation
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
Linear Tabulated Resolutions for the Well-Founded Semantics
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Efficient fixpoint computation in linear tabling
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Linear tabulated resolution based on Prolog control strategy
Theory and Practice of Logic Programming
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Semi-naive evaluation in linear tabling
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
On applying or-parallelism and tabling to logic programs
Theory and Practice of Logic Programming
Linear tabling strategies and optimizations
Theory and Practice of Logic Programming
Defining and continuous checking of structural program dependencies
Proceedings of the 30th international conference on Software engineering
A Sketch of a Complete Scheme for Tabled Execution Based on Program Transformation
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Towards a Complete Scheme for Tabled Execution Based on Program Transformation
PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
Dynamic reordering of alternatives for definite logic programs
Computer Languages, Systems and Structures
Incremental Answer Completion in the SLG-WAM
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A Tabling Implementation Based on Variables with Multiple Bindings
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A Term-Based Global Trie for Tabled Logic Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
On Improving the Efficiency of Deterministic Calls and Answers in Tabled Logic Programs
EPIA '09 Proceedings of the 14th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Approximate pruning in tabled logic programming
ESOP'03 Proceedings of the 12th European conference on Programming
An improved continuation call-based implementation of tabling
PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
Swapping evaluation: A memory-scalable solution for answer-on-demand tabling*
Theory and Practice of Logic Programming
Tabling with answer subsumption: implementation, applications and performance
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
A subterm-based global trie for tabled evaluation of logic programs
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
Dynamic mixed-strategy evaluation of tabled logic programs
ICLP'05 Proceedings of the 21st international conference on Logic Programming
AMaχoS: abstract machine for Xcerpt: architecture
PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
Tabling in mercury: design and implementation
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Compact lists for tabled evaluation
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
A simple and efficient implementation of concurrent local tabling
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
An efficient implementation of linear tabling based on dynamic reordering of alternatives
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Theory and Practice of Logic Programming - Prolog Systems
Xsb: Extending prolog with tabled logic programming
Theory and Practice of Logic Programming - Prolog Systems
The language features and architecture of b-prolog
Theory and Practice of Logic Programming - Prolog Systems
Tabling for higher-order logic programming
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
A framework for reasoning with rough sets
Transactions on Rough Sets IV
On improving the efficiency and robustness of table storage mechanisms for tabled evaluation
PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages
Prolog performance on larger datasets
PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages
A segment-swapping approach for executing trapped computations
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
A general implementation framework for tabled CLP
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
A Generalized QSQR Evaluation Method for Horn Knowledge Bases
ACM Transactions on Computational Logic (TOCL)
Towards multi-threaded local tabling using a common table space
Theory and Practice of Logic Programming
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
| Hi-index | 0.00 |
SLG resolution uses tabling to evaluate nonfloundering normal logic pr ograms according to the well-founded semantics. The SLG-WAM, which forms the engine of the XSB system, can compute in-memory recursive queries an order of magnitute faster than current deductive databases. At the same time, the SLG-WAM tightly intergrates Prolog code with tabled SLG code, and executes Prolog code with minimal overhead compared to the WAM. As a result, the SLG-WAM brings to logic programming important termination and complexity properties of deductive databases. This article describes the architecture of the SLG-WAM for a powerful class of programs, the class of fixed-order dynamically stratified programs. We offer a detailed description of the algorithms, data structures, and instructions that the SLG-WAM adds to the WAM, and a performance analysis of engine overhead due to the extensions.