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
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
A logical language for data and knowledge bases
A logical language for data and knowledge bases
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
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
Fixpoint extensions of first-order logic and datalog-like languages
Proceedings of the Fourth Annual Symposium on Logic in computer science
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Minimum and maximum predicates in logic programming
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A non-deterministic deductive database language
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Deductive databases: achievements and future directions
ACM SIGMOD Record - Directions for future database research & development
The valid model semantics for logic programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semi-determinism (extended abstract)
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Negation and minimality in non-horn databases
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
The logic of totally and partially ordered plans: a deductive database approach
Annals of Mathematics and Artificial Intelligence
On the partial semantics for disjunctive deductive databases
Annals of Mathematics and Artificial Intelligence
Programming with non-determinism in deductive databases
Annals of Mathematics and Artificial Intelligence
"Possible is certain'' is desirable and can be expressive
Annals of Mathematics and Artificial Intelligence
On non-determinism in machines and languages
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Pushing extrema aggregates to optimize logic queries
Information Systems
On the computational complexity of assumption-based argumentation for default reasoning
Artificial Intelligence
Abduction in logic programming: a new definition and an abductive procedure based on rewriting
Artificial Intelligence
WFS + Branch and Bound = Stable Models
IEEE Transactions on Knowledge and Data Engineering
G-Log: A Graph-Based Query Language
IEEE Transactions on Knowledge and Data Engineering
Computation of Stable Models and Its Integration with Logical Query Processing
IEEE Transactions on Knowledge and Data Engineering
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
Coherence Approach to Logic Program Revision
IEEE Transactions on Knowledge and Data Engineering
Nonmonotonic Logic Programming
IEEE Transactions on Knowledge and Data Engineering
Dynamic Programming in Datalog with Aggregates
IEEE Transactions on Knowledge and Data Engineering
Nondeterministic, Nonmonotonic Logic Databases
IEEE Transactions on Knowledge and Data Engineering
A Deductive Database Approach to A.I. Planning
Journal of Intelligent Information Systems
Abduction in Logic Programming
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Argumentation-Based Proof Procedures for Credulous and Sceptical Non-monotonic Reasoning
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Search and Optimization Problems in Datalog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
On the Role of Negation in Choice Logic Programs
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
On Verification in Logic Database Languages
CL '00 Proceedings of the First International Conference on Computational Logic
Choice Logic Programs and Nash Equilibria in Strategic Games
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
User-Defined Aggregates in Database Languages
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
New Generation Computing
Data and knowledge in database systems: deductive databases
Handbook of data mining and knowledge discovery
Optimal Models of Disjunctive Logic Programs: Semantics, Complexity, and Computation
IEEE Transactions on Knowledge and Data Engineering
Theory and Practice of Logic Programming
Declarative semantics for active rules
Theory and Practice of Logic Programming
Event choice datalog: a logic programming language for reasoning in multiple dimensions
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Comparisons and computation of well-founded semantics for disjunctive logic programs
ACM Transactions on Computational Logic (TOCL)
Graphs and colorings for answer set programming
Theory and Practice of Logic Programming
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
Issues in parallel execution of non-monotonic reasoning systems
Parallel Computing
An introduction to fuzzy answer set programming
Annals of Mathematics and Artificial Intelligence
Explicit and default negation in databases and logic programs
Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research
Twelve Definitions of a Stable Model
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Elementary sets for logic programs
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A hierarchy of tractable subsets for computing stable models
Journal of Artificial Intelligence Research
Preferred arguments are harder to compute than stable extensions
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
New look at the semantics and optimization methods of CP-networks
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A model-theoretic counterpart of loop formulas
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Answer Sets in a Fuzzy Equilibrium Logic
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Head-elementary-set-free logic programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Knowledge representation and non-monotonic reasoning
A 25-year perspective on logic programming
Logic programming languages for databases and the web
A 25-year perspective on logic programming
Abstract answer set solvers with backjumping and learning
Theory and Practice of Logic Programming
Thirteen definitions of a stable model
Fields of logic and computation
On elementary loops of logic programs
Theory and Practice of Logic Programming
Recent advances in declarative networking
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
Oscillating behavior of logic programs
Correct Reasoning
A Classification Theory Of Semantics Of Normal Logic Programs: I. Strong Properties
Fundamenta Informaticae
Rule-based policy representation and reasoning for the semantic web
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Confluence analysis for distributed programs: a model-theoretic approach
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Data exchange in datalog is mainly a matter of choice
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
| Hi-index | 0.00 |
Previous researchers have proposed generalizations of Horn clause logic to support negation and non-determinism as two separate extensions. In this paper, we show that the stable model semantics for logic programs provides a unified basis for the treatment of both concepts. First, we introduce the concepts of partial models, stable models, strongly founded models and deterministic models and other interesting classes of partial models and study their relationships. We show that the maximal deterministic model of a program is a subset of the intersection of all its stable models and that the well-founded model of a program is a subset of its maximal deterministic model. Then, we show that the use of stable models subsumes the use of the non-deterministic choice construct in LDL and provides an alternative definition of the semantics of this construct. Finally, we provide a constructive definition for stable models with the introduction of a procedure, called backtracking fixpoint, that non-deterministically constructs a total stable model, if such a model exists.