Pages that link to "Item:Q1274974"
From MaRDI portal
The following pages link to Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974):
Displaying 11 items.
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Ordered model trees: A normal form for disjunctive deductive databases (Q1344891) (← links)
- Querying disjunctive databases through nonmonotonic logics (Q1350535) (← links)
- The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- Partial equilibrium logic (Q2457796) (← links)
- Interlinking logic programs and argumentation frameworks (Q2694581) (← links)
- On the expressive power of the relational algebra with partially ordered domains (Q4951743) (← links)
- (Q5475454) (← links)