Sciweavers

59 search results - page 3 / 12
» Parametric Representations of Boolean Constraints
Sort
View
PPDP
2009
Springer
14 years 5 days ago
A declarative encoding of telecommunications feature subscription in SAT
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
Michael Codish, Samir Genaim, Peter J. Stuckey
SG
2005
Springer
13 years 11 months ago
Multi-level Interaction in Parametric Design
Parametric design systems model a design as a constrained collection of schemata. Designers work in such systems at two levels: definition of schemata and constraints; and search w...
Robert Aish, Robert Woodbury
CAV
2010
Springer
251views Hardware» more  CAV 2010»
13 years 9 months ago
Automated Assume-Guarantee Reasoning through Implicit Learning
Abstract. We propose a purely implicit solution to the contextual assumption generation problem in assume-guarantee reasoning. Instead of improving the L∗ algorithm — a learnin...
Yu-Fang Chen, Edmund M. Clarke, Azadeh Farzan, Min...
EPIA
2007
Springer
13 years 11 months ago
Two Puzzles Concerning Measures of Uncertainty and the Positive Boolean Connectives
Abstract. The two puzzles are the Lottery Paradox and the Amalgamation Paradox, which both point out difficulties for aggregating uncertain information. A generalization of the lot...
Gregory R. Wheeler
DAC
2009
ACM
14 years 6 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke