Pages that link to "Item:Q1370627"
From MaRDI portal
The following pages link to On the partial semantics for disjunctive deductive databases (Q1370627):
Displaying 30 items.
- Semi-equilibrium models for paracoherent answer set programs (Q253992) (← links)
- Minimalism, justification and non-monotonicity in deductive databases (Q1123011) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation (Q1363783) (← links)
- Duality for goal-driven query processing in disjunctive deductive databases (Q1598444) (← links)
- An abstract argumentation and logic programming comparison based on 5-valued labellings (Q2146012) (← links)
- Assumption-based argumentation is logic programming with projection (Q2146013) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming (Q2269506) (← links)
- On the equivalence between logic programming semantics and argumentation semantics (Q2344367) (← links)
- Partial equilibrium logic (Q2457796) (← links)
- Constructing interpretations of deductive databases using reduction and dynamic stratification (Q2734660) (← links)
- Modular Paracoherent Answer Sets (Q2938513) (← links)
- Negation and minimality in disjunctive databases (Q3125092) (← links)
- Characterising and Explaining Inconsistency in Logic Programs (Q3449230) (← links)
- (Q3798295) (← links)
- Stable semantics for disjunctive programs (Q3983045) (← links)
- (Q3999568) (← links)
- Annotated defeasible logic (Q4592709) (← links)
- Abduction in argumentation frameworks (Q4685530) (← links)
- (Q4866586) (← links)
- Conjunctive partial deduction: foundations, control, algorithms, and experiments (Q4939538) (← links)
- Paracoherent Answer Set Semantics meets Argumentation Frameworks (Q5108496) (← links)
- Better Paracoherent Answer Sets with Less Resources (Q5108500) (← links)
- On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs (Q5108512) (← links)
- (Q5475454) (← links)
- Composing Normal Programs with Function Symbols (Q5504671) (← links)
- An extension to GCWA and query evaluation for disjunctive deductive databases (Q5957024) (← links)
- A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness (Q6066787) (← links)
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming (Q6566627) (← links)
