Pages that link to "Item:Q3001916"
From MaRDI portal
The following pages link to Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses (Q3001916):
Displaying 14 items.
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
- A progression semantics for first-order logic programs (Q1680677) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- A multiparametric view on answer set programming (Q2317973) (← links)
- First-order stable model semantics with intensional functions (Q2321299) (← links)
- Vicious circle principle, aggregates, and formation of sets in ASP based languages (Q2321320) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Applying Visible Strong Equivalence in Answer-Set Program Transformations (Q2900532) (← links)
- Improving the Normalization of Weight Rules in Answer Set Programs (Q2938492) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- The Seventh Answer Set Programming Competition: Design and Results (Q4957192) (← links)
- (Q5020979) (← links)
- Aspmc: new frontiers of algebraic answer set counting (Q6566624) (← links)
- IASCAR: incremental answer set counting by anytime refinement (Q6656460) (← links)