The following pages link to (Q3089162):
Displaying 13 items.
- On abstract modular inference systems and solvers (Q286083) (← links)
- Relating constraint answer set programming languages and algorithms (Q490456) (← links)
- Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP (Q2055805) (← links)
- First-order stable model semantics with intensional functions (Q2321299) (← links)
- A New Incarnation of Action Language H (Q2900548) (← links)
- System aspmt2smt: Computing ASPMT Theories by SMT Solvers (Q2938519) (← links)
- aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming (Q3449196) (← links)
- A model building framework for answer set programming with external computations (Q4593036) (← links)
- <tt>ASPeRiX</tt>, a first-order forward chaining approach for answer set computing (Q4593088) (← links)
- <i>Clingcon</i>: The next generation (Q4593092) (← links)
- Constraint answer set solver EZCSP and why integration schemas matter (Q4593093) (← links)
- On relation between constraint answer set programming and satisfiability modulo theories (Q4593096) (← links)
- CASP solutions for planning in hybrid domains (Q4593097) (← links)
