A Characterisation of First-Order Constraint Satisfaction Problems

Authors:
Benoit Larose;Cynthia Loten;Claude Tardif
Affiliations:
Concordia University, Canada;Royal Military College of Canada, Canada;Royal Military College of Canada, Canada
Venue:
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Year:
2006

Citing 0
Cited 13

A rendezvous of logic, complexity, and algebra

ACM SIGACT News
On digraph coloring problems and treewidth duality

European Journal of Combinatorics
Majority constraints have bounded pathwidth duality

European Journal of Combinatorics
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures

European Journal of Combinatorics
Forbidden lifts (NP and CSP for combinatorialists)

European Journal of Combinatorics
Majority functions on structures with finite duality

European Journal of Combinatorics
Recent Results on the Algebraic Approach to the CSP

Complexity of Constraints
A Logical Approach to Constraint Satisfaction

Complexity of Constraints
Affine systems of equations and counting infinitary logic

Theoretical Computer Science
A rendezvous of logic, complexity, and algebra

ACM Computing Surveys (CSUR)
Universal algebra and hardness results for constraint satisfaction problems

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Affine systems of equations and counting infinitary logic

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Constraint Satisfaction, Irredundant Axiomatisability and Continuous Colouring

Studia Logica

Quantified Score

Hi-index	0.00

Visualization

Abstract

The UCLID project seeks to develop formal verification tools for infinite-state systems having a degree of automation comparable to that of model checking tools for finitestate systems. The UCLID modeling language describes systems where the state variables ...