Pages that link to "Item:Q1337468"

The following pages link to A three-valued semantics for deductive databases and logic programs (Q1337468):

Displaying 19 items.

• Semi-equilibrium models for paracoherent answer set programs (Q253992) (← links)
• Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
• Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
• Abduction in logic programming: A new definition and an abductive procedure based on rewriting (Q1614866) (← links)
• Three-valued semantics for hybrid MKNF knowledge bases revisited (Q1677437) (← links)
• Paracoherent answer set computation (Q2238696) (← links)
• Solving logic program conflict through strong and weak forgettings (Q2457621) (← links)
• Oscillating Behavior of Logic Programs (Q2900531) (← links)
• Modular Paracoherent Answer Sets (Q2938513) (← links)
• Characterizations of stable model semantics for logic programs with arbitrary constraint atoms (Q3183130) (← links)
• Characterising and Explaining Inconsistency in Logic Programs (Q3449230) (← links)
• Annotated defeasible logic (Q4592709) (← links)
• Abduction in argumentation frameworks (Q4685530) (← links)
• On the extension of logic programming with negation through uniform proofs (Q5101453) (← links)
• Paracoherent Answer Set Semantics meets Argumentation Frameworks (Q5108496) (← links)
• Better Paracoherent Answer Sets with Less Resources (Q5108500) (← links)
• Answering the “why” in answer set programming – A survey of explanation approaches (Q5197747) (← links)
• Characterizing D-WFS: Confluence and iterated GCWA (Q5236439) (← links)
• Complexity of super-coherence problems in ASP (Q5418947) (← links)