<--- Back to Details
First PageDocument Content
Constraint satisfaction problem / Local consistency / FO / Boolean satisfiability problem / Decomposition method / Complexity of constraint satisfaction / Theoretical computer science / Constraint programming / Applied mathematics
Date: 2013-07-25 05:33:36
Constraint satisfaction problem
Local consistency
FO
Boolean satisfiability problem
Decomposition method
Complexity of constraint satisfaction
Theoretical computer science
Constraint programming
Applied mathematics

Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics

Add to Reading List

Source URL: ijcai.org

Download Document from Source Website

File Size: 755,72 KB

Share Document on Facebook

Similar Documents

Guidance & Model Language for Amending a Shoreland Ordinance for Consistency with Minnesota’s Buffer Law – For Permitted Agricultural Uses If a local government’s shoreland ordinance currently requires a 50-foot or

DocID: 1uj0L - View Document

Important new laws applying to Local Council elections and Local Government Councillors commenced 1 JulyThe new laws are to promote integrity in the Local Government electoral process, and have consistency with Lo

DocID: 1sa2e - View Document

Constraint programming / XPath / FO / XML tree / Computing / Software engineering / Theoretical computer science / Decomposition method / Local consistency

Reasoning about XML Update Constraints∗ Bogdan Cautis Serge Abiteboul INRIA Futurs & U. Paris Sud

DocID: 1rjFm - View Document

Computing / Software engineering / Computer programming / Graphical models / Probability theory / Markov random field / Local consistency / Random field / Scala

Rounding Guarantees for Message-Passing MAP Inference with Logical Dependencies I S

DocID: 1r1mx - View Document

Graphical models / Mathematics / Mathematical analysis / Probability / Mathematical optimization / Combinatorial optimization / Linear programming / Operations research / Markov random field / Linear programming relaxation / Relaxation / Randomized rounding

Unifying Local Consistency and MAX SAT Relaxations for Scalable Inference with Rounding Guarantees Stephen H. Bach University of Maryland

DocID: 1r1cx - View Document