Titlebook: Constraint Programming: Basics and Trends; 1994 Chatillon Sprin Andreas Podelski Conference proceedings 1995 Springer-Verlag Berlin Heidelb

TINGE

书目名称Constraint Programming: Basics and Trends影响因子(影响力)




书目名称Constraint Programming: Basics and Trends影响因子(影响力)学科排名




书目名称Constraint Programming: Basics and Trends网络公开度




书目名称Constraint Programming: Basics and Trends网络公开度学科排名




书目名称Constraint Programming: Basics and Trends被引频次




书目名称Constraint Programming: Basics and Trends被引频次学科排名




书目名称Constraint Programming: Basics and Trends年度引用




书目名称Constraint Programming: Basics and Trends年度引用学科排名




书目名称Constraint Programming: Basics and Trends读者反馈




书目名称Constraint Programming: Basics and Trends读者反馈学科排名

Polydipsia

Acetaldehyde

Interval constraint logic programming,aint solving over continuous and discrete quantities, we establish a strong ling between approximations and local consistency notions and show that arc-consistency is an instance of the approximation framework. We finally describe recent work on different variants of the initial algorithm proposed b

相一致

inhumane

International Studies in Entrepreneurshipl-known abstract domain . showing that combining finite domain symbolic constraints with bottom-up abstract interpretation provides analyses that are at the same time accurate, efficient and specializable. (Such analyses are called on-line, goal-independent or condensing.)

Charitable

Charitable

Abstract interpretation and finite domain symbolic constraints,l-known abstract domain . showing that combining finite domain symbolic constraints with bottom-up abstract interpretation provides analyses that are at the same time accurate, efficient and specializable. (Such analyses are called on-line, goal-independent or condensing.)

pineal-gland

organism

Solving pseudo-Boolean constraints, the domain {0,1} originating from mathematical programming. The key concepts are the generation of strong valid inequalities for the solution set of a constraint system and the notion of branch-and-cut.

Madrigal

Toupie: A constraint language for model checking,uations, that are not available in CLP languages. In this paper, we present, the language Toupie that is designed to solve such constraints. Toupie uses an extension of Bryant‘s binary decision diagrams to encode relations which makes it possible to handle relations with huge numbers of elements.