Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Paraconsistent logic programming
Theoretical Computer Science
Extended stable semantics for normal and disjunctive programs
Logic programming
Well-founded semantics coincides with three-valued stable semantics
Fundamenta Informaticae
Bilattices and the semantics of logic programming
Journal of Logic Programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Stationary semantics for disjunctive logic programs and deductive databases
Proceedings of the 1990 North American conference on Logic programming
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
Artificial Intelligence
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
A survey of paraconsistent semantics for logic programs
Handbook of defeasible reasoning and uncertainty management systems
Logic programming revisited: logic programs as inductive definitions
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
Logic-based artificial intelligence
Fixpoint semantics for logic programming a survey
Theoretical Computer Science
Paraconsistent Declarative Semantics for Extended Logic Programs
Annals of Mathematics and Artificial Intelligence
Uniform semantic treatment of default and autoepistemic logics
Artificial Intelligence
The Well-Founded Semantics in Normal Logic Programs with Uncertainty
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Uncertainty and Partial Non-uniform Assumptions in Parametric Deductive Databases
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Stable Model Semantics for Probabilistic Deductive Databases
ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Annals of Mathematics and Artificial Intelligence
A top-k query answering procedure for fuzzy logic programming
Fuzzy Sets and Systems
Fuzzy autoepistemic logic and its relation to fuzzy answer set programming
Fuzzy Sets and Systems
Hi-index | 0.00 |
Stable model semantics has become a very popular approach for the management of negation in logic programming. This approach relies mainly on the closed world assumption to complete the available knowledge and its formulation has its basis in the so-called Gelfond–Lifschitz transformation. The primary goal of this work is to present an alternative and epistemic-based characterization of stable model semantics, to the Gelfond-Lifschitz transformation. In particular, we show that stable model semantics can be defined entirely as an extension of the Kripke-Kleene semantics. Indeed, we show that the closed world assumption can be seen as an additional source of ‘falsehood’ to be added cumulatively to the Kripke-Kleene semantics. Our approach is purely algebraic and can abstract from the particular formalism of choice as it is based on monotone operators (under the knowledge order) over bilattices only.