Pages that link to "Item:Q5277748"
From MaRDI portal
The following pages link to Why are there so many loop formulas? (Q5277748):
Displayed 12 items.
- Weight constraint programs with evaluable functions (Q645084) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- Loop formulas for circumscription (Q2457644) (← links)
- On elementary loops of logic programs (Q2884258) (← links)
- Integrating Inductive Definitions in SAT (Q3498482) (← links)
- Finding Reductions Automatically (Q3586003) (← links)
- An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems (Q3638568) (← links)
- Answer Set Programming: A Primer (Q3638997) (← links)
- Some (in)translatability results for normal logic programs and propositional theories (Q3647255) (← links)
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets (Q5445291) (← links)
- Quo Vadis Answer Set Programming? (Q5504648) (← links)
- On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP (Q5504658) (← links)