Pages that link to "Item:Q4015962"

The following pages link to Short note preferred extensions are partial stable models (Q4015962):

Displaying 16 items.

• Three-valued completion for abductive logic programs (Q671511) (← links)
• Contributions to the stable model semantics of logic programs with negation (Q672705) (← links)
• Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
• Soundness of abductive proof procedure with respect to constraint for non-ground abducibles (Q1274977) (← links)
• Adding closed world assumptions to well-founded semantics (Q1314417) (← links)
• On the duality of abduction and model generation in a framework for model generation with equality (Q1314425) (← links)
• Logic program semantics and circumscription of autoepistemic theories (Q1327306) (← links)
• On rules of abduction. (Q1353881) (← links)
• The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337) (← links)
• A unifying view for logic programming with non-monotonic reasoning (Q1390932) (← links)
• An abstract, argumentation-theoretic approach to default reasoning (Q1402718) (← links)
• Integrating induction and abduction in logic programming (Q1818759) (← links)
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games (Q1855240) (← links)
• A nondeterministic well-founded semantics (Q1924729) (← links)
• Dialectic proof procedures for assumption-based, admissible argumentation (Q2457643) (← links)
• Oscillating Behavior of Logic Programs (Q2900531) (← links)