Loading...
Please wait, while we are loading the content...
Similar Documents
Constraint Answer Set Programming
| Content Provider | Semantic Scholar |
|---|---|
| Author | Lierler, Yuliya |
| Copyright Year | 2012 |
| Abstract | Constraint answer set programming (CASP) is a novel, promising direction of research whose roots go back to propositional satisfiability (SAT). SAT solvers are efficient tools for solving boolean constraint satisfaction problems that arise in different areas of computer science, including software and hardware verification. Some constraints are more naturally expressed by non-boolean constructs. Satisfiability modulo theories (SMT) extends boolean satisfiability by the integration of non-boolean symbols defined by a background theory in another formalism, such as a constraint processing language. Answer set programming (ASP) extends computational methods of SAT in yet another way, inspired by ideas from knowledge representation, logic programming, and nonmonotonic reasoning. As a declarative programming paradigm, it provides a rich, simple modeling language that, among other features, incorporates recursive definitions. Answer set programming languages also use variables; software tools called grounders are used as front ends of answer set solvers to eliminate variables, whereas SAT-like procedures form their back-ends. Constraint answer set programming draws on both of these extensions of SAT technology: it integrates answer set programming with constraint processing. This new area has already demonstrated promising results, including the development of the CASP solvers acsolver [11] (Texas Tech University), clingcon [7] (Potsdam University, Germany), ezcsp [1] (KODAK), idp [15] (KU Leuven), mingo [10] (Aalto University, Finland). CASP is a new, powerful paradigm for declarative programming that provides new modeling features for answer set programming and also improves grounding and solving performance by delegating processing of constraints over large and possibly infinite domains to specialized systems. As a result CASP opens new horizons for declarative programming applications. The origins of this work go back to [2]. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.cs.nmsu.edu/ALP/wp-content/uploads/2012/09/casp-alp.pdf |
| Alternate Webpage(s) | http://www.cs.utexas.edu/~ai-lab/pubs/casp-alp.pdf |
| Alternate Webpage(s) | http://www.cs.utexas.edu/users/ai-lab/pubs/casp-alp.pdf |
| Alternate Webpage(s) | https://digitalcommons.unomaha.edu/cgi/viewcontent.cgi?article=1007&context=compscifacpub |
| Alternate Webpage(s) | http://www.cs.utexas.edu/users/tag/papers-ailab2/casp-alp.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
