The following pages link to (Q5282991):
Displaying 14 items.
- Learning discrete decomposable graphical models via constraint optimization (Q517387) (← links)
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
- A multi-shot ASP encoding for the aircraft routing and maintenance planning problem (Q2055823) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Writing Declarative Specifications for Clauses (Q2835876) (← links)
- SAT Modulo Graphs: Acyclicity (Q2938490) (← links)
- Answer Set Programming Modulo Acyclicity (Q3449199) (← links)
- Multi-level Algorithm Selection for ASP (Q3449227) (← links)
- The Design of the Sixth Answer Set Programming Competition (Q3449235) (← links)
- Optimizing phylogenetic supertrees using answer set programming (Q4593001) (← links)
- The Seventh Answer Set Programming Competition: Design and Results (Q4957192) (← links)
- (Q5020979) (← links)
- Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
