Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Negation in rule-based database languages: a survey
Selected papers of the workshop on Deductive database theory
Logic programming with strong negation
Proceedings of the international workshop on Extensions of logic programming
Journal of the ACM (JACM)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Generalized disjunctive well-founded semantics for logic programs: procedural semantics
Methodologies for intelligent systems, 5
Semantics for disjunctive logic programs with explicit and default negation
Fundamenta Informaticae
A knowledge representation framework based on autoepistemic logic of minimal beliefs
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
A characterization of the partial stable models for disjunctive deductive databases
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Combining closed world assumptions with stable negation
Fundamenta Informaticae - Special issue: to the memory of Prof. Cecylia Rauszer
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On Extended Disjunctive Logic Programs
ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
ICLP '94/NMELP '94 Selected papers from the Workshop on Non-Monotonic Extensions of Logic Programming
Semantics of knowledge-based systems with multiple forms of negation
Semantics of knowledge-based systems with multiple forms of negation
A Classification Theory Of Semantics Of Normal Logic Programs: I. Strong Properties
Fundamenta Informaticae
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Logic programming with default, weak and strict negations
Theory and Practice of Logic Programming
Explicit and default negation in databases and logic programs
Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research
Combining Closed World Assumptions with Stable Negation
Fundamenta Informaticae
| Hi-index | 0.00 |
Logic knowledge based systems (LKBS) containing at most one form of default negation and explicit (or “classical”) negation have been studied in the literature. In this paper we describe a class of LKBS containing multiple forms of default negation in addition to explicit negation. We define a semantics for these systems in terms of the well‐founded semantics defined by Van Gelder et al. (1988) and the stable semantics introduced by Gelfond and Lifschitz (1988) and later extended to the 3‐valued case by Przymusinski (1991). We investigate properties of the new combined semantics and calculate the computational complexity of three main reasoning tasks for this semantics, namely existence of models, skeptical and credulous reasoning. An effective procedure to construct the collection of models characterizing the semantics of such a system is given. Applications to knowledge representation and knowledge base merging are presented.