Pages that link to "Item:Q4815033"
From MaRDI portal
The following pages link to On the expressibility of stable logic programming (Q4815033):
Displaying 5 items.
- My work with Victor Marek: a mathematician looks at answer set programming (Q1028636) (← links)
- Exploiting conjunctive queries in description logic programs (Q1028641) (← links)
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (Q2206456) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- Finding similar/diverse solutions in answer set programming (Q5298797) (← links)
