Journal of Logic Programming
Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Inferring negative information from disjunctive databases
Journal of Automated Reasoning
Foundations of deductive databases and logic programming
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
Equivalences of logic programs
Foundations of deductive databases and 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
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
A Procedural Semantics for Well Founded Negation in Logic Programs
A Procedural Semantics for Well Founded Negation in Logic Programs
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
An alternating fixpoint tailored to magic programs
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query evaluation under the well-founded semantics
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A three-valued semantics for deductive databases and logic programs
Journal of Computer and System Sciences
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
Independence of logic database queries and update
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Modular stratification and magic sets for DATALOG programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive powers of the logic programming semantics (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
IEEE Transactions on Knowledge and Data Engineering
High-Level Petri Net Model of Logic Program with Negation
IEEE Transactions on Knowledge and Data Engineering
Programming in autoepistemic logic
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
Semantics For Disjunctive Logic Programs With Explicit And Default Negation
Fundamenta Informaticae
| Hi-index | 0.00 |
We introduce global SLS-resolution, a procedural semantics for well-founded negation as defined by Van Gelder, Ross and Schlipf. Global SLS-resolution extends Prsymusinski's SLS-resolution, and may be applied to all programs, whether locally stratified or not.1 Global SLS-resolution is defined in terms of global trees, a new data structure representing the dependence of goals on derived negative subgoals. We prove that global SLS-resolution is sound with respect to the well-founded semantics, and complete for non-floundering queries.