Short note preferred extensions are partial stable models
From MaRDI portal
Publication:4015962
DOI10.1016/0743-1066(92)90015-UzbMath0769.68081WikidataQ62615157 ScholiaQ62615157MaRDI QIDQ4015962
Antonis C. Kakas, Paolo Mancarella
Publication date: 10 November 1992
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Related Items (17)
Logic program semantics and circumscription of autoepistemic theories ⋮ Oscillating Behavior of Logic Programs ⋮ On rules of abduction. ⋮ The expressive powers of stable models for bound and unbound DATALOG queries ⋮ A nondeterministic well-founded semantics ⋮ A unifying view for logic programming with non-monotonic reasoning ⋮ An abstract, argumentation-theoretic approach to default reasoning ⋮ Dialectic proof procedures for assumption-based, admissible argumentation ⋮ Three-valued completion for abductive logic programs ⋮ Contributions to the stable model semantics of logic programs with negation ⋮ A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics ⋮ Integrating induction and abduction in logic programming ⋮ Expressive power and complexity of partial models for disjunctive deductive databases ⋮ Soundness of abductive proof procedure with respect to constraint for non-ground abducibles ⋮ On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games ⋮ Adding closed world assumptions to well-founded semantics ⋮ On the duality of abduction and model generation in a framework for model generation with equality
This page was built for publication: Short note preferred extensions are partial stable models
