Sciweavers

151 search results - page 6 / 31
» Handling Boolean A Boxes
Sort
View
SPIN
2007
Springer
14 years 1 months ago
SAT-Based Summarization for Boolean Programs
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
Gérard Basler, Daniel Kroening, Georg Weiss...
DATE
2005
IEEE
176views Hardware» more  DATE 2005»
14 years 1 months ago
Effective Lower Bounding Techniques for Pseudo-Boolean Optimization
Linear Pseudo-Boolean Optimization (PBO) is a widely used modeling framework in Electronic Design Automation (EDA). Due to significant advances in Boolean Satisfiability (SAT), ...
Vasco M. Manquinho, João P. Marques Silva
ESA
2003
Springer
117views Algorithms» more  ESA 2003»
14 years 20 days ago
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
Abstract. We describe a data structure for three-dimensional Nef complexes, algorithms for boolean operations on them, and our implementation of data structure and algorithms. Nef ...
Miguel Granados, Peter Hachenberger, Susan Hert, L...
JSAT
2006
108views more  JSAT 2006»
13 years 7 months ago
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
Niklas Eén, Niklas Sörensson
JCM
2007
131views more  JCM 2007»
13 years 7 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze