Sciweavers

CP
2009
Springer
13 years 2 months ago
Lazy Clause Generation Reengineered
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...
Thibaut Feydy, Peter J. Stuckey
JUCS
2002
110views more  JUCS 2002»
13 years 4 months ago
Generation of Constants and Synchronization of Finite Automata
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
Arto Salomaa
CATS
2008
13 years 6 months ago
Modelling for Lazy Clause Generation
Lazy clause generation is a hybrid SAT and finite domain propagation solver that tries to combine the advantages of both: succinct modelling using finite domains and powerful nogo...
Olga Ohrimenko, Peter J. Stuckey
ICTAI
1996
IEEE
13 years 8 months ago
COMPOzE: Intention-based Music Composition through Constraint Programming
The goal of this work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the...
Martin Henz, Stefan Lauer, Detlev Zimmermann