Negation as failure: careful closure procedure

DOI10.1016/0004-3702(86)90001-9zbMath0635.68119OpenAlexW101701348MaRDI QIDQ1097727

Halina Przymusinska, Michael Gelfond

Publication date: 1986

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(86)90001-9

zbMATH Keywords

closed world assumptionquery evaluationnegation as failureinference engineclosure procedureHorn databases

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items

The complexity of propositional closed world reasoning and circumscription, Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete, On the relationship between circumscription and negation as failure, An algorithm to compute circumscription, Circumscribing DATALOG: expressive power and complexity, ECWA made easy, On the computational cost of disjunctive logic programming: Propositional case, Logic programming and reasoning with incomplete information, Is intractability of nonmonotonic reasoning a real drawback?, Disjunctive closures for knowledge compilation, Closed world assumptions having precedence in predicates, An efficient method for eliminating varying predicates from a circumscription, On the complexity of propositional knowledge base revision, updates, and counterfactuals, Conditional entailment: bridging two approaches to default reasoning., CWA Extensions to Multi-Valued Logics, Fuzzy information in extended fuzzy relational databases

Cites Work

• Saturation, nonmonotonic reasoning and the closed-world assumption
• On the satisfiability of circumscription
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item