Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
From MaRDI portal
Publication:3694733
DOI10.1016/0743-1066(84)90023-2zbMath0575.68094OpenAlexW2041706386MaRDI QIDQ3694733
Publication date: 1984
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(84)90023-2
Related Items (22)
Closed-world databases and circumscription ⋮ Domain-independent formulas and databases ⋮ First-order theories for pure Prolog programs with negation ⋮ Negation as failure: careful closure procedure ⋮ Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions ⋮ Intuitionistic three-valued logic and logic programming ⋮ On the relationship between circumscription and negation as failure ⋮ Minimalism, justification and non-monotonicity in deductive databases ⋮ Well-founded and stationary models of logic programs ⋮ The Prolog not-predicate and negation as failure rule ⋮ A new deductive approach to planning ⋮ Closed world assumptions having precedence in predicates ⋮ Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints ⋮ Acyclic logic programs and the completeness of SLDNF-resolution ⋮ Unfold/fold transformation of stratified programs ⋮ Complete extension of general logic programs ⋮ The relationship between stable, supported, default and autoepistemic semantics for general logic programs ⋮ Static filtering on stratified programs ⋮ Goals and benchmarks for automated map reasoning ⋮ Strict completion of logic programs ⋮ A sound and complete semantics for a version of negation as failure ⋮ Compiling dyadic first-order specifications into map algebra
This page was built for publication: Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
