Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,166,814 papers from all fields of science
Search
Sign In
Create Free Account
Gecode
Gecode (for Generic Constraint Development Environment) is a software library for solving Constraint satisfaction problems. It is programmed in C…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
AMPL
C++
Constraint satisfaction
Constraint satisfaction problem
Expand
Broader (1)
Constraint programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Simple and Effective Sign Consistency Using Interval Arithmetic
F. Bergenti
,
Stefania Monica
Italian Conference on Computational Logic
2019
Corpus ID: 195769691
Polynomial constraints over finite domains are expressed as equalities, inequalities, and disequalities of polynomials with…
Expand
2018
2018
A Decision Support System for Food Recycling based on Constraint Logic Programming and Ontological Reasoning
F. Chesani
,
Giuseppe Cota
,
E. Lamma
,
P. Mello
,
Fabrizio Riguzzi
Italian Conference on Computational Logic
2018
Corpus ID: 52882134
In 2011, FAO estimated that about one third of the total production of edible food for human consumption, gets lost or wasted…
Expand
2013
2013
Compilation for QCSP
I. Stéphan
arXiv.org
2013
Corpus ID: 15019555
We propose in this article a framework for compilation of quantified constraint satisfaction problems (QCSP). We establish the…
Expand
2011
2011
3D Interactive Objects Layout using Virtual Reality Techniques and Constraint Programming
Marouene Kefi
,
P. Richard
,
Vincent Barichard
International Conference on Computer Graphics…
2011
Corpus ID: 41201998
Virtual Reality (VR) is a promising tool for effectively visualizing and interacting with objects and 3D environments. However…
Expand
2011
2011
Performance analysis of constraint solvers for coverage directed test generation
M. P. J. George
,
O. Mohamed
ICM Proceeding
2011
Corpus ID: 30650971
Constraint random testing (CRT) is the most common verification technique used nowadays. Coverage driven constraint random test…
Expand
2010
2010
On using Constraints for Network Intrusion Detection
Pedro D. Salgueiro
,
Salvador Abreu
2010
Corpus ID: 11848461
In this work we present a domain specific language for net- work intrusion detection that allows to describe network intrusions…
Expand
2009
2009
Maintaining State in Propagation Solvers
Raphael M. Reischuk
,
Christian Schulte
,
Peter James Stuckey
,
Guido Tack
International Conference on Principles and…
2009
Corpus ID: 15325204
Constraint propagation solvers interleave propagation, removing impossible values from variable domains, with search. The solver…
Expand
2009
2009
Network Monitoring with Constraint Programming: Preliminary Specification and Analysis
Pedro D. Salgueiro
,
Salvador Abreu
International Conference on Applications of…
2009
Corpus ID: 15302356
Network Monitoring and Intrusion Detection Systems plays an important role in today's computer networks health, allowing the…
Expand
2008
2008
Perfect Derived Propagators
Christian Schulte
,
Guido Tack
International Conference on Principles and…
2008
Corpus ID: 5267648
When implementing a propagator for a constraint, one must decide about variants: When implementing min , should one also…
Expand
2006
2006
Generating Propagators for Finite Set Constraints
Guido Tack
,
Christian Schulte
,
G. Smolka
International Conference on Principles and…
2006
Corpus ID: 6803785
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE