Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Tree search and ARC consistency in constraint satisfaction algorithms
Search in Artificial Intelligence
Backtrack-free and backtrack-bounded search
Search in Artificial Intelligence
The combinatorics of object recognition in cluttered environments using constrained search
Artificial Intelligence
Exact solution in linear time of networks of constraints using perfect relaxation
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Experimental evaluation of preprocessing techniques in constraint satisfaction problems
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
An algebraic approach to constraint satisfaction problems
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
A comparison of ATMS and CSP techniques
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Knowledge Compilation Using Interval Automata and Applications to Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Variable and clause ordering in an FSA approach to propositional satisfiability
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
A finite state intersection approach to propositional satisfiability
Theoretical Computer Science
Representing CSPs with set-labeled diagrams: a compilation map
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
| Hi-index | 0.00 |
In this paper, we explore the idea of representing CSPs using techniques from formal language theory. The solution set of a CSP can be expressed as a regular language; we propose the minimized deterministic finite state automaton (MDFA) recognizing this language as a canonical representation for the CSP. This representation has a number of advantages. Explicit (enumerated) constraints can be stored in lesser space than traditional techniques. Implicit constraints and networks of constraints can be composed from explicit ones by using a complete algebra of boolean operators like AND, OR, NOT, etc., applied in an arbitrary manner. Such constraints are stored in the same way as explicit constraints -- by using MDFAs. This capability allows our technique to construct networks of constraints incrementally. After constructing this representation, answering queries like satisfiability, validity, equivalence, etc., becomes trivial as this representation is canonical. Thus, MDFAs serve as a means to represent constraints as well as to reason with them. While this technique is not a panacea for solving CSPs, experiments demonstrate that it is much better than previously known techniques on certain types of problems.