Pages that link to "Item:Q1900917"
From MaRDI portal
The following pages link to The expressive powers of the logic programming semantics (Q1900917):
Displayed 19 items.
- Tie-breaking semantics and structural totality (Q676419) (← links)
- Magic Sets and their application to data integration (Q882436) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337) (← links)
- Revision programming (Q1389448) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- On the equivalence and range of applicability of graph-based representations of logic programs. (Q1853147) (← links)
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs (Q1926591) (← links)
- Recursive rules with aggregation: a simple unified semantics (Q2151406) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- Writing Declarative Specifications for Clauses (Q2835876) (← links)
- atalog: A logic language for expressing search and optimization problems (Q3550912) (← links)
- FO(FD): Extending classical logic with rule-based fixpoint definitions (Q3585169) (← links)
- Some (in)translatability results for normal logic programs and propositional theories (Q3647255) (← links)
- Expressiveness of Logic Programs under the General Stable Model Semantics (Q5278207) (← links)