Solving Temporal CSPs via Enumeration and SAT Compilation
The constraint satisfaction problem (CSP) is a powerful framework used in theoretical computer science for formulating a multitude of problems. The CSP over a constraint language Γ (CSP(Γ)) is the decision problem of verifying whether a set of constraints based on the relations in Γ admits a satisf...
Main Author: | Eriksson, Leif |
---|---|
Format: | Others |
Language: | English |
Published: |
Linköpings universitet, Institutionen för datavetenskap
2019
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-162482 |
Similar Items
-
Upper Bounds on the Time Complexity of Temporal CSPs
by: Stockman, Peter
Published: (2016) -
An extension of the PPSZ Algorithm to Infinite-Domain Constraint Satisfaction Problems
by: Einarson, Carl
Published: (2017) -
Efficient IR for the OpenModelica Compiler
by: Eriksson, Simon, et al.
Published: (2018) -
SAT doku Att lösa Sudoku med moderna SAT-lösare
by: AXELSSON, LUDVIG, et al.
Published: (2014) -
Factoring integers with parallel SAT solvers
by: Lundén, Daniel, et al.
Published: (2015)