Expressive power and complexity of partial models for disjunctive deductive databases
From MaRDI portal
(Redirected from Publication:1274974)
Recommendations
Cites work
- A restricted second order logic for finite structures
- A survey of complexity results for non-monotonic logics
- A three-valued semantics for deductive databases and logic programs
- Autoepistemic logic
- Circumscribing DATALOG: expressive power and complexity
- Complexity and undecidability results for logic programming
- Deterministic and non-deterministic stable models
- General logical databases and programs: Default logic semantics and stratification
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 3755910 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 25192 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 1241670 (Why is no real title available?)
- scientific article; zbMATH DE number 1142327 (Why is no real title available?)
- scientific article; zbMATH DE number 1158758 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Logic programming and negation: A survey
- Negation in rule-based database languages: A survey
- On the computational cost of disjunctive logic programming: Propositional case
- On the equivalence of semantics for normal logic programs
- On the expressive power of Datalog: tools and a case study.
- On the partial semantics for disjunctive deductive databases
- Propositional semantics for disjunctive logic programs
- Second order logic and the weak exponential hierarchies
- Short note preferred extensions are partial stable models
- Stable and extension class theory for logic programs and default logics
- Structure and complexity of relational queries
- The expressive power of stratified logic programs
- The expressive powers of stable models for bound and unbound DATALOG queries
- The expressive powers of the logic programming semantics
- The polynomial-time hierarchy
- The well-founded semantics for general logic programs
- Why not negation by fixpoint?
Cited in
(16)- Succinctness as a source of complexity in logical formalisms
- Ordered model trees: A normal form for disjunctive deductive databases
- Querying disjunctive databases through nonmonotonic logics
- The expressive powers of stable models for bound and unbound DATALOG queries
- Logic programming and knowledge representation---The A-Prolog perspective
- On the computational complexity of assumption-based argumentation for default reasoning.
- Complexity results for answer set programming with bounded predicate arities and implications
- Partial equilibrium logic
- Interlinking logic programs and argumentation frameworks
- Complexity of the Stable Model Semantics for Queries on Incomplete Databases
- Intuitionistic deductive databases and the polynomial time hierarchy
- scientific article; zbMATH DE number 1114053 (Why is no real title available?)
- More on tractable disjunctive Datalog
- On the expressive power of the relational algebra with partially ordered domains
- scientific article; zbMATH DE number 5033761 (Why is no real title available?)
- Abstract argumentation frameworks with strong and weak constraints
This page was built for publication: Expressive power and complexity of partial models for disjunctive deductive databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274974)
