Pages that link to "Item:Q1200977"

The following pages link to On the relations between stable and well-founded semantics of logic programs (Q1200977):

Displaying 21 items.

• Tie-breaking semantics and structural totality (Q676419) (← links)
• Magic Sets and their application to data integration (Q882436) (← links)
• Computing only minimal answers in disjunctive deductive databases (Q1040782) (← links)
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs (Q1199545) (← links)
• Soundness of abductive proof procedure with respect to constraint for non-ground abducibles (Q1274977) (← links)
• Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
• A unifying view for logic programming with non-monotonic reasoning (Q1390932) (← links)
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games (Q1855240) (← links)
• A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs (Q1926591) (← links)
• Recursive rules with aggregation: a simple unified semantics (Q2151406) (← links)
• Characterising and Explaining Inconsistency in Logic Programs (Q3449230) (← links)
• (Q3983046) (← links)
• Equivalence of well-founded and stable semantics (Q4311649) (← links)
• Stable-unstable semantics: Beyond NP with normal logic programs (Q4593043) (← links)
• On the expressibility of stable logic programming (Q4815033) (← links)
• Abduction in well-founded semantics and generalized stable models via tabled dual programs (Q4819009) (← links)
• Complexity of super-coherence problems in ASP (Q5418947) (← links)
• (Q5445168) (← links)
• MICAI 2004: Advances in Artificial Intelligence (Q5901927) (← links)
• A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics (Q5958767) (← links)
• On Signings and the Well-Founded Semantics (Q6063875) (← links)