Representing constraint satisfaction problems in answer set programming
zbMATH Open1219.68083MaRDI QIDQ3089162FDOQ3089162
Authors: Marcello Balduccini 
Publication date: 24 August 2011
Full work available at URL: https://www.mat.unical.it/ASPOCP09/
Recommendations
global constraintsconstraint satisfaction problemsunified approachspecification languageanswer set programming (ASP)industrial-size applications
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cited In (30)
- Constraint answer set programming without grounding
- A model building framework for answer set programming with external computations
- Title not available (Why is that?)
- 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
- On relation between constraint answer set programming and satisfiability modulo theories
- Title not available (Why is that?)
- A new incarnation of action language H
- 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
- Modelling grammar constraints with answer set programming
- Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP
- First-order stable model semantics with intensional functions
- aspartame: solving constraint satisfaction problems with answer set programming
- Title not available (Why is that?)
- Constraint Answer Set Solving
- Representing the language of the causal calculator in answer set programming
- System \textsc{aspmt2smt}: computing ASPMT theories by SMT solvers
- \textit{clingcon}: the next generation
- Detection and exploitation of functional dependencies for model generation
Uses Software
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)
