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
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and 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
Query evaluation in recursive databases: bottom-up and top-down reconciled
Data & Knowledge Engineering
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
The semantics of deductive databases
The semantics of deductive databases
Tabulated resolution for well founded semantics
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
A portable method for integrating SLG resolution into prolog systems
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computation of Stable Models and Its Integration with Logical Query Processing
IEEE Transactions on Knowledge and Data Engineering
Well-Founded Ordered Search (Extended Abstract)
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Extending partial deduction to tabled execution: some results and open issues
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
An abstract machine for tabled execution of fixed-order stratified logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Tabled logic programming for verification and program analysis
ACM SIGSOFT Software Engineering Notes
Principles, practice, and applications of tabled logic programming
ACM SIGSOFT Software Engineering Notes
Extending constraint logic programming with open functions
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Termination proofs for logic programs with tabling
ACM Transactions on Computational Logic (TOCL)
Logic programming revisited: logic programs as inductive definitions
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Loop checks for logic programs with functions
Theoretical Computer Science
On the complexity analysis of static analyses
Journal of the ACM (JACM)
A procedural semantics for stratified database updates
Annals of Mathematics and Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Tabling for non-monotonic programming
Annals of Mathematics and Artificial Intelligence
Composite Distributive Lattices as Annotation Domains for Mediators
Annals of Mathematics and Artificial Intelligence
Resolution for Skeptical Stable Model Semantics
Journal of Automated Reasoning
SLT-Resolution for the Well-Founded Semantics
Journal of Automated Reasoning
Model-based analysis of configuration vulnerabilities
Journal of Computer Security
Delegation logic: A logic-based approach to distributed authorization
ACM Transactions on Information and System Security (TISSEC)
Protecting deductive databases from unauthorized retrieval and update requests
Data & Knowledge Engineering - Data and applications security
Implementation of Tabled Evaluation with Delaying in Prolog
IEEE Transactions on Knowledge and Data Engineering
Efficient Recursive Aggregation and Negation in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
Nonmonotonic Logic Programming
IEEE Transactions on Knowledge and Data Engineering
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
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
ICLP '02 Proceedings of the 18th 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
Access Control for Deductive Databases by 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
Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Implementation of a Linear Tabling Mechanism
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
A Model Checker for Value-Passing Mu-Calculus Using Logic Programming
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Constraint Database Models Characterizing Timed Bisimilarity
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Semantics-Based Filtering: Logic Programming's Killer App?
PADL '02 Proceedings of the 4th International Symposium 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
Hypothesis-Founded Semantics for Datalog Programs with Negation
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Key Constraints and Monotonic Aggregates in Deductive Databases
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
A Case Study in Using Preference Logic Grammars for Knowledge Representations
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Linear Tabulated Resolutions for the Well-Founded Semantics
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Resource-Constrained Model Checking of Recursive Programs
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Well-Founded Optimism: Inheritance in Frame-Based Knowledge Bases
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
A Foundation for Hybrid Knowledge Bases
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Termination Analysis for Tabled Logic Programming
LOPSTR '97 Proceedings of the 7th International Workshop on Logic Programming Synthesis and Transformation
Constraint Logic Programming for Local and Symbolic Model-Checking
CL '00 Proceedings of the First International Conference on Computational Logic
Model Checking for Timed Logic Processes
CL '00 Proceedings of the First International Conference on Computational Logic
On the Problem of Computing the Well-Founded Semantics
CL '00 Proceedings of the First International Conference on Computational Logic
Perfect Model Checking via Unfold/Fold Transformations
CL '00 Proceedings of the First International Conference on Computational Logic
ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
Composite Distributive Lattices as Annotation Domains for Mediators
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
A Top-Down Procedure for Disjunctive Well-Founded Semantics
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
Handbook of automated reasoning
From datalog rules to efficient programs with time and space guarantees
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Efficient fixpoint computation in linear tabling
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
A dynamic approach to characterizing termination of general logic programs
ACM Transactions on Computational Logic (TOCL)
Scalability and efficiency in multi-relational data mining
ACM SIGKDD Explorations Newsletter
An unfold/fold transformation framework for definite logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Transformation-based bottom-up computation of the well-founded model
Theory and Practice of Logic Programming
On the problem of computing the well-founded semantics
Theory and Practice of Logic Programming
Linear tabulated resolution based on Prolog control strategy
Theory and Practice of Logic Programming
Abduction in well-founded semantics and generalized stable models via tabled dual programs
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
Context-sensitive program analysis as database queries
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Mode-directed preferences for logic programs
Proceedings of the 2005 ACM symposium on Applied computing
Incremental and demand-driven points-to analysis using logic programming
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Optimization with mode-directed preferences
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Optimization of bound disjunctive queries with constraints
Theory and Practice of Logic Programming
A UML model consistency verification approach based on meta-modeling formalization
Proceedings of the 2006 ACM symposium on Applied computing
Fast partial evaluation of pattern matching in strings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Logic program specialisation through partial deduction: Control issues
Theory and Practice of Logic Programming
Two case studies of semantics execution in Maude: CCS and LOTOS
Formal Methods in System Design
DisLoP: a research project on Disjunctive Logic Programming
AI Communications
Proceedings of the 12th ACM symposium on Access control models and technologies
Interactive, scalable, declarative program analysis: from prototype to implementation
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Linear tabling strategies and optimizations
Theory and Practice of Logic Programming
Access control by action control
Proceedings of the 13th ACM symposium on Access control models and technologies
Reasoning with recursive loops under the PLP framework
ACM Transactions on Computational Logic (TOCL)
Verifiable agent interaction in abductive logic programming: The SCIFF framework
ACM Transactions on Computational Logic (TOCL)
Declarative programming for verification: lessons and outlook
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
ACM Transactions on Information and System Security (TISSEC)
Concurrency, Graphs and Models
Generating Specialized Rules and Programs for Demand-Driven Analysis
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Simulation Subsumption or Déjà vu on the Web
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Concurrent and Local Evaluation of Normal Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A Sketch of a Complete Scheme for Tabled Execution Based on Program Transformation
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
High Level Thread-Based Competitive Or-Parallelism in Logtalk
PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
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
Relational Models for Tabling Logic Programs in a Database
Applications of Declarative Programming and Knowledge Management
From datalog rules to efficient programs with time and space guarantees
ACM Transactions on Programming Languages and Systems (TOPLAS)
ActionScript bytecode verification with co-logic programming
Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security
Alternation as a programming paradigm
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
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
Improving the efficiency of inductive logic programming through the use of query packs
Journal of Artificial Intelligence Research
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
Queries to Hybrid MKNF Knowledge Bases through Oracular Tabling
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Termination prediction for general logic programs
Theory and Practice of Logic Programming
Combining logic programs and monadic second order logics by program transformation
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Approximate pruning in tabled logic programming
ESOP'03 Proceedings of the 12th European conference on Programming
Fuzzy-DL reasoning over unknown fuzzy degrees
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
The role of abduction in declarative authorization policies
PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
An improved continuation call-based implementation of tabling
PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
An interpolation method for CLP traversal
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A logic for state-modifying authorization policies
ACM Transactions on Information and System Security (TISSEC)
Four lessons in versatility or how query languages adapt to the web
Semantic techniques for the web
SecPAL: Design and semantics of a decentralized authorization language
Journal of Computer Security - Digital Identity Management (DIM 2007)
Precise complexity analysis for efficient datalog queries
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Swapping evaluation: A memory-scalable solution for answer-on-demand tabling*
Theory and Practice of Logic Programming
Querying in EL+ with Nonmonotonic Rules
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Hybrid reasoning with non-monotonic rules
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
Retroactive subsumption-based tabled evaluation of logic programs
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Tabled resolution + constraints: a recipe for model checking real-time systems
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Programming cryptographic protocols
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
More efficient datalog queries: subsumptive tabling beats magic sets
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Local closed world reasoning with description logics under the well-founded semantics
Artificial Intelligence
Program specialization for verifying infinite state systems: an experimental evaluation
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Normative systems represented as hybrid knowledge bases
CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems
A subterm-based global trie for tabled evaluation of logic programs
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
Querying OWL 2 QL and non-monotonic rules
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Symbolic support graph: a space efficient data structure for incremental tabled evaluation
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Mode-directed fixed point computation
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
The SOUL tool suite for querying programs in symbiosis with Eclipse
Proceedings of the 9th International Conference on Principles and Practice of Programming in Java
Using datalog with binary decision diagrams for program analysis
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
JQuery: a generic code browser with a declarative configuration language
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Tabling in mercury: design and implementation
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Incremental evaluation of tabled prolog: beyond pure logic programs
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
A local algorithm for incremental evaluation of tabled logic programs
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Implementing query answering for hybrid MKNF knowledge bases
PADL'10 Proceedings of the 12th 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
Query answering in normal logic programs under uncertainty
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
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
An overview of ciao and its design philosophy
Theory and Practice of Logic Programming - Prolog Systems
Uncertainty management in logic programming: simple and effective top-down query answering
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Tabling for higher-order logic programming
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
A provably correct compiler for efficient model checking of mobile processes
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
A framework for reasoning with rough sets
Transactions on Rough Sets IV
Inheritance in rule-based frame systems: semantics and inference
Journal on Data Semantics VII
Automatic incrementalization of prolog based static analyses
PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages
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
Compiling constraint handling rules for efficient 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
Using real relaxations during program specialization
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
Efficient proving for practical distributed access-control systems
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
A logic for state-modifying authorization policies
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Towards multi-threaded local tabling using a common table space
Theory and Practice of Logic Programming
Efficient tabling of structured data with enhanced hash-consing
Theory and Practice of Logic Programming
A generalised framework for dispute derivations in assumption-based argumentation
Artificial Intelligence
Query-Driven Procedures for Hybrid MKNF Knowledge Bases
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.01 |
SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation of predicate calculus as a programming language and forms the computational basis for Prolog systems. Despite its advantages for stack-based 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 be terminate due to infinite recursion through negation; and (c) it may repeatedly evaluate the same literal in a rule body, leading to unacceptable performance.We address all three problems for goal-oriented query evaluation of general logic programs by presenting tabled evaluation with delaying, called SLG resolution. It has three distinctive features: (i) SLG resolution is a partial deduction procedure, consisting of seven fundamental transformations. A query is transformed step by step into a set of answers. The use of transformations separates logical issues of query evaluation from procedural ones. SLG allows an arbitrary computation rule for selecting a literal from a rule body and an arbitrary control strategy for selecting transformations to apply.(ii) SLG resolution is sound and search space complete with respect to the well-founded partial model for all non-floundering queries, and preserves all three-valued stable models. To evaluate a query under differenc three-valued stable models, SLG resolution can be enhanced by further processing of the answers of subgoals relevant to a query.(iii) SLG resolution avoids both positive and negative loops and always terminates for programs with the bounded-term-size property. It has a polynomial time data complexity for well-founded negation of function-free programs. Through a delaying mechanism for handling ground negative literals involved in loops, SLG resolution avoids the repetition of any of its derivation steps.Restricted forms of SLG resolution are identified for definite, locally stratified, and modularly stratified programs, shedding light on the role each transformation plays.