On the partial semantics for disjunctive deductive databases

DOI10.1023/A:1018947420290zbMath0880.68029MaRDI QIDQ1370627

Nicola Leone, Thomas Eiter, Domenico Saccà

Publication date: 26 October 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

deductive databasespartial stable models

Mathematics Subject Classification ID

Database theory (68P15)

Related Items

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, Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation, Modular Paracoherent Answer Sets, A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness, Annotated defeasible logic, Paracoherent Answer Set Semantics meets Argumentation Frameworks, Better Paracoherent Answer Sets with Less Resources, On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs, Partial equilibrium logic, Paracoherent answer set computation, Complete extensions in argumentation coincide with 3-valued stable models in logic programming, Abduction in argumentation frameworks, Expressive power and complexity of partial models for disjunctive deductive databases, Composing Normal Programs with Function Symbols, On the equivalence between logic programming semantics and argumentation semantics, Semi-equilibrium models for paracoherent answer set programs