Sciweavers

157 search results - page 24 / 32
» Multi-Objective Propagation in Constraint Programming
Sort
View
AGP
2003
IEEE
14 years 21 days ago
Interpreting Abduction in CLP
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...
Marco Gavanelli, Evelina Lamma, Paola Mello, Miche...
CJ
2010
150views more  CJ 2010»
13 years 4 months ago
Program Analysis Probably Counts
Abstract. Semantics-based program analysis uses an abstract semantics of programs/systems to statically determine run-time properties. Classic examples from compiler technology inc...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
CP
2009
Springer
14 years 2 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
CVPR
2009
IEEE
15 years 2 months ago
Constrained Clustering via Spectral Regularization
We propose a novel framework for constrained spectral clustering with pairwise constraints which specify whether two objects belong to the same cluster or not. Unlike previous m...
Zhenguo Li (The Chinese University of Hong Kong), ...
CP
2007
Springer
14 years 1 months ago
The Log-Support Encoding of CSP into SAT
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
Marco Gavanelli