Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

97

Voted

CADE
2004
Springer

114views Logical Reasoning» more CADE 2004»

Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract

16 years 3 months ago

Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract

Download users.info.unicaen.fr

Àngel J. Gil, Bruno Zanuttini, Gernot Salze

Real-time Traffic

Automated Reasoning | CADE 2004 | Constraint Description Problems |

claim paper

Related Content

» Complexity of Clausal Constraints Over Chains

» A global constraint for total weighted completion time for cumulative resources

» Branch and Infer A Unifying Framework for Integer and Finite Domain Constraint Programming

» Lexicographicallyordered constraint satisfaction problems

» An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constra...

» Stochastic Satisfiability Modulo Theories for Nonlinear Arithmetic

» Dynamic PET Reconstruction Using Wavelet Regularization With Adapted Basis Functions

» Satisfiability Modulo the Theory of Costs Foundations and Applications

» A Study on Continuous MaxFlow and MinCut Approaches

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2004
Where	CADE
Authors	Àngel J. Gil, Bruno Zanuttini, Gernot Salzer, Miki Hermann

Comments (0)