Sciweavers

69 search results - page 2 / 14
» Modelling for Lazy Clause Generation
Sort
View
CP
2009
Springer
14 years 2 days 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...
MEMOCODE
2010
IEEE
13 years 3 months ago
A flexible schema for generating explanations in lazy theory propagation
Abstract--Theory propagation in Satisfiability Modulo Theories is crucial for the solver's performance. It is important, however, to pay particular care to the amount of deduc...
Roberto Bruttomesso, Edgar Pek, Natasha Sharygina
PADL
2005
Springer
13 years 10 months ago
Functional Framework for Sound Synthesis
We present an application of functional programming in the domain of sound generation and processing. We use the lazy language Clean to define purely functional stream generators,...
Jerzy Karczmarczuk
CADE
2009
Springer
14 years 5 months ago
Decidability Results for Saturation-Based Model Building
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
Matthias Horbach, Christoph Weidenbach
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
13 years 7 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter