On the relationship between circumscription and negation as failure
From MaRDI portal
Publication:1115207
DOI10.1016/0004-3702(89)90068-4zbMath0663.68097OpenAlexW2008294142MaRDI QIDQ1115207
Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski
Publication date: 1989
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(89)90068-4
nonmonotonic reasoningnegation as failurecircumscriptionnegative informationlogic-based knowledge representation systems
Related Items
Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete, Formalizing incomplete knowledge in incomplete databases, Preferences in artificial intelligence, Characterising equilibrium logic and nested logic programs: Reductions and complexity,, Combining answer set programming with description logics for the semantic web, Update rules in datalog programs, Inferring negative information from disjunctive databases, ECWA made easy, Static semantics for normal and disjunctive logic programs, Well-founded and stationary models of logic programs, On the computational cost of disjunctive logic programming: Propositional case, Autoepistemic logic of knowledge and beliefs, Two simple characterizations of well-founded semantics, Is intractability of nonmonotonic reasoning a real drawback?, Embedding circumscriptive theories in general disjunctive programs, Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete, Brave induction: a logical framework for learning from incomplete information, Disjunctive closures for knowledge compilation, Closed world assumptions having precedence in predicates, Brave Induction, Three-valued nonmonotonic formalisms and semantics of logic programs, On the parameterized complexity of non-monotonic logics, An efficient method for eliminating varying predicates from a circumscription, Linear resolution for consequence finding, On the complexity of propositional knowledge base revision, updates, and counterfactuals, The complexity of circumscriptive inference in Post's lattice, Trichotomies in the complexity of minimal inference, Relating minimal models and pre-requisite-free normal defaults, On the equivalence of the static and disjunctive well-founded semantics and its computation, Bounded treewidth as a key to tractability of knowledge representation and reasoning, Embedding prioritized circumscription in disjunctive logic programs, Embedding Logics in the Local Computation Framework, The semantics of incomplete databases as an expression of preferences, CWA Extensions to Multi-Valued Logics, Strong and explicit negation in non-monotonic reasoning and logic programming, An abductive framework for negation in disjunctive logic programming, Logic-based subsumption architecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Saturation, nonmonotonic reasoning and the closed-world assumption
- Semantical considerations on nonmonotonic logic
- Closed-world databases and circumscription
- Negation as failure: careful closure procedure
- An algorithm to compute circumscription
- Results on translating defaults to circumscription
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Non-monotonic logic. I
- Deduction in non-Horn databases
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
- Horn clause queries and generalizations
- A kripke-kleene semantics for logic programs*
- Nonmonotonic Logic II
- The Semantics of Predicate Logic as a Programming Language
