Pages that link to "Item:Q1362337"
From MaRDI portal
The following pages link to The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337):
Displaying 7 items.
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857) (← links)
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). (Q1854304) (← links)
- Functional queries in datalog (Q1862647) (← links)
- atalog: A logic language for expressing search and optimization problems (Q3550912) (← links)
- On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach (Q5140009) (← links)
- On acceptance conditions in abstract argumentation frameworks (Q6494661) (← links)
