On the partial semantics for disjunctive deductive databases

Cited In (28)

Semi-equilibrium models for paracoherent answer set programs
Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
Duality for goal-driven query processing in disjunctive deductive databases
On the equivalence between logic programming semantics and argumentation semantics
Complete extensions in argumentation coincide with 3-valued stable models in logic programming
Title not available (Why is that?)
Abduction in argumentation frameworks
Expressive power and complexity of partial models for disjunctive deductive databases
Paracoherent answer set computation
Characterising and Explaining Inconsistency in Logic Programs
An abstract argumentation and logic programming comparison based on 5-valued labellings
Assumption-based argumentation is logic programming with projection
A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness
Composing Normal Programs with Function Symbols
Partial equilibrium logic
Title not available (Why is that?)
Negation and minimality in disjunctive databases
Modular Paracoherent Answer Sets
Title not available (Why is that?)
Conjunctive partial deduction: foundations, control, algorithms, and experiments
On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs
Annotated defeasible logic
Better Paracoherent Answer Sets with Less Resources
Paracoherent Answer Set Semantics meets Argumentation Frameworks
Title not available (Why is that?)
An extension to GCWA and query evaluation for disjunctive deductive databases
Minimalism, justification and non-monotonicity in deductive databases
Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation

This page was built for publication: On the partial semantics for disjunctive deductive databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370627)