Representing constraint satisfaction problems in answer set programming
From MaRDI portal
Publication:3089162
Recommendations
Cited in
(30)- Detection and exploitation of functional dependencies for model generation
- Constraint answer set programming without grounding
- A model building framework for answer set programming with external computations
- scientific article; zbMATH DE number 7455706 (Why is no real title available?)
- On abstract modular inference systems and solvers
- Relating constraint answer set programming languages and algorithms
- Constraint answer set programming systems
- Integrating answer set programming and constraint logic programming
- An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
- A translational approach to constraint answer set solving
- Logic Programming
- A new incarnation of action language H
- On relation between constraint answer set programming and satisfiability modulo theories
- scientific article; zbMATH DE number 1322793 (Why is no real title available?)
- CASP solutions for planning in hybrid domains
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
- Constraint answer set solver EZCSP and why integration schemas matter
- Integrating Answer Set Reasoning with Constraint Solving Techniques
- Industrial-size scheduling with ASP+CP
- Representing production scheduling with constraint answer set programming
- Finding similar/diverse solutions in answer set programming
- Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP
- Modelling grammar constraints with answer set programming
- First-order stable model semantics with intensional functions
- aspartame: solving constraint satisfaction problems with answer set programming
- scientific article; zbMATH DE number 1322792 (Why is no real title available?)
- Representing the language of the causal calculator in answer set programming
- System \textsc{aspmt2smt}: computing ASPMT theories by SMT solvers
- Constraint Answer Set Solving
- \textit{clingcon}: the next generation
This page was built for publication: Representing constraint satisfaction problems in answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089162)