<--- Back to Details
First PageDocument Content
Constraint programming / Theoretical computer science / Constraint / Mathematical optimization / Exact cover / Logic programming / Software engineering / Cognitive science / Constraint logic programming / First class constraint
Date: 2010-05-28 10:14:09
Constraint programming
Theoretical computer science
Constraint
Mathematical optimization
Exact cover
Logic programming
Software engineering
Cognitive science
Constraint logic programming
First class constraint

Properties of IsaCoSy’s Constraint Generation Algorithm Moa Johansson, Lucas Dixon, Alan Bundy February 16, 2010 Abstract This report states and sketches the proofs for some important properties of

Add to Reading List

Source URL: dream.inf.ed.ac.uk

Download Document from Source Website

File Size: 77,48 KB

Share Document on Facebook

Similar Documents

Theory and Practice of Logic Programming, Vol. 6, No. 5, pp, Programming Finite-Domain Constraint Propagators in Action Rules

Theory and Practice of Logic Programming, Vol. 6, No. 5, pp, Programming Finite-Domain Constraint Propagators in Action Rules

DocID: 1tOef - View Document

Proceedings of  CICLOPS 2009 9th International Colloquium on Implementation of Constraint and LOgic Programming Systems

Proceedings of CICLOPS 2009 9th International Colloquium on Implementation of Constraint and LOgic Programming Systems

DocID: 1t8iI - View Document

On the Robustness of Qualitative Distance- and Direction-Reasoning* Jung-Hong Hong Department of Surveying Engineering National Cheng-Kung University

On the Robustness of Qualitative Distance- and Direction-Reasoning* Jung-Hong Hong Department of Surveying Engineering National Cheng-Kung University

DocID: 1rqXQ - View Document

CONTRIBUTED TALK ABSTRACTS 1.2  JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent devel

CONTRIBUTED TALK ABSTRACTS 1.2 JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent devel

DocID: 1rm3f - View Document

AAAI Proceedings Template

AAAI Proceedings Template

DocID: 1r9Ui - View Document