Semantical considerations on nonmonotonic logic
Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Readings in nonmonotonic reasoning
Readings in nonmonotonic reasoning
Paraconsistent logic programming
Theoretical Computer Science
Bilattices and the semantics of logic programming
Journal of Logic Programming
Journal of the ACM (JACM)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
Artificial Intelligence
Nonmonotonic Logic II: Nonmonotonic Modal Theories
Journal of the ACM (JACM)
A survey of paraconsistent semantics for logic programs
Handbook of defeasible reasoning and uncertainty management systems
Data mining: concepts and techniques
Data mining: concepts and techniques
Inductive Logic Programming: Techniques and Applications
Inductive Logic Programming: Techniques and Applications
Fixpoint semantics for logic programming a survey
Theoretical Computer Science
Paraconsistent Declarative Semantics for Extended Logic Programs
Annals of Mathematics and Artificial Intelligence
A Parametric Approach to Deductive Databases with Uncertainty
IEEE Transactions on Knowledge and Data Engineering
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
Parametrized semantics of logic programs: a unifying framework
Theoretical Computer Science
Hypothesis-based semantics of logic programs in multivalued logics
ACM Transactions on Computational Logic (TOCL)
Induction from answer sets in nonmonotonic logic programs
ACM Transactions on Computational Logic (TOCL)
Any-World Access to OWL from Prolog
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
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
Integrated Query Answering with Weighted Fuzzy Rules
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Annals of Mathematics and Artificial Intelligence
Towards a logical reconstruction of a theory for locally closed databases
ACM Transactions on Database Systems (TODS)
Information Sciences: an International Journal
Representing defaults and negative information without negation-as-failure
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A top-k query answering procedure for fuzzy logic programming
Fuzzy Sets and Systems
Hi-index | 5.23 |
Due to the usual incompleteness of information representation, any approach to assign a semantics to logic programs has to rely on a default assumption on the missing information. The stable model semantics, that has become the dominating approach to give semantics to logic programs, relies on the Closed World Assumption (CWA), which asserts that by default the truth of an atom is false. There is a second well-known assumption, called Open World Assumption (OWA), which asserts that the truth of the atoms is supposed to be unknown by default. However, the CWA, the OWA and the combination of them are extremal, though important, assumptions over a large variety of possible assumptions on the truth of the atoms, whenever the truth is taken from an arbitrary truth space.The topic of this paper is to allow any assignment (i.e. interpretation), over a truth space, to be a default assumption. Our main result is that our extension is conservative in the sense that under the "everywhere false" default assumption (CWA) the usual stable model semantics is captured. Due to the generality and the purely algebraic nature of our approach, it abstracts from the particular formalism of choice and the results may be applied in other contexts as well.