Journal article
Quantified constraints: Algorithms and complexity
- Abstract:
-
The standard constraint satisfaction problem over an arbitrary finite domain can be expressed as follows: given a first-order sentence consisting of a conjunction of predicates, where all of the variables are existentially quantified, determine whether the sentence is true. This problem can be parameterized by the set of allowed constraint predicates. With each predicate, one can associate certain predicate-preserving operations, called polymorphisms, and the complexity of the parameterized p...
Expand abstract
- Publication status:
- Published
Actions
Authors
Bibliographic Details
- Journal:
- COMPUTER SCIENCE LOGIC, PROCEEDINGS
- Volume:
- 2803
- Pages:
- 58-70
- Publication date:
- 2003-01-01
- EISSN:
-
1611-3349
- ISSN:
-
0302-9743
- Source identifiers:
-
328587
Item Description
- Language:
- English
- Pubs id:
-
pubs:328587
- UUID:
-
uuid:f8c3e620-f41c-444d-a431-f2d76e8aa175
- Local pid:
- pubs:328587
- Deposit date:
- 2013-11-17
Terms of use
- Copyright date:
- 2003
If you are the owner of this record, you can report an update to it here: Report update to this record