Pages that link to "Item:Q4593048"
From MaRDI portal
The following pages link to Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper) (Q4593048):
Displaying 18 items.
- Lifting symmetry breaking constraints with inductive logic programming (Q2163186) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring (Q2694562) (← links)
- Learning domain-specific heuristics for answer set solvers (Q2883067) (← links)
- Combining Heuristics for Configuration Problems Using Answer Set Programming (Q3449221) (← links)
- Shared aggregate sets in answer set programming (Q4559794) (← links)
- Cautious reasoning in ASP via minimal models and unsatisfiable cores (Q4559795) (← links)
- Efficiently Coupling the I-DLV Grounder with ASP Solvers (Q4957193) (← links)
- The External Interface for Extending WASP (Q4957194) (← links)
- (Q5020542) (← links)
- Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems (Q5038464) (← links)
- Beyond NP: Quantifying over Answer Sets (Q5108497) (← links)
- Better Paracoherent Answer Sets with Less Resources (Q5108500) (← links)
- Partial Compilation of ASP Programs (Q5108506) (← links)
- Debugging Non-ground ASP Programs: Technique and Graphical Tools (Q5197755) (← links)
- Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach (Q5870535) (← links)
- ASP and subset minimality: enumeration, cautious reasoning and MUSes (Q6103676) (← links)
- Adaptive large-neighbourhood search for optimisation in answer-set programming (Q6665706) (← links)
