Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/satisfiability-based-algorithms-for-boolean-optimization-Rkxt63Zx4h
References (27)
-
G. Nemhauser, L. Wolsey (1988)
Integer and Combinatorial Optimization -
P. Flores, H. Neto, Joao Marques-Silva (1998)
An exact solution to the minimum size test pattern problemProceedings International Conference on Computer Design. VLSI in Computers and Processors (Cat. No.98CB36273)
-
O. Coudert (1994)
Two-level logic minimization: an overviewIntegr., 17
-
G. Micheli (1994)
Synthesis and Optimization of Digital Circuits -
James Gimpel (1964)
A Reduction Technique for Prime Implicant Tables -
N. Nilsson (1996)
STUART RUSSELL AND PETER NORVIG, ARTIFICIAL INTELLIGENCE: A MODERN APPROACHArtificial Intelligence, 82
-
M. Davis, H. Putnam (1960)
A computing procedure for quantification theoryJournal of the Association for Computing Machinery, 7
-
O. Coudert, J. Madre (1995)
New Ideas for Solving Covering Problems32nd Design Automation Conference
-
O. Coudert (1993)
Two-level logic minimization, an overview, IntegrationThe VLSI Journal, 17
-
M. Bazaraa, J. Jarvis, H. Sherali (1990)
Linear programming and network flows (2nd ed.) -
Joao Marques-Silva, K. Sakallah (1996)
GRASP-A new search algorithm for satisfiabilityProceedings of International Conference on Computer Aided Design
-
(1992)
UNIX Manual Page of lp-solve -
F. Fallah, S. Liao, S. Devadas (1997)
Solving Covering Problems Using LPR-based Lower BoundsProceedings of the 34th Design Automation Conference
-
P. Barth (1995)
A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization -
S. Yang (1991)
Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 -
Hantao Zhang (1997)
SATO: An Efficient Propositional Prover -
M. Bazaraa, J. Jarvis, H. Sherali (1977)
Linear Programming and Network Flows -
(1997)
and R -
T. Villa, T. Kam, R. Brayton, A. Sangiovanni-Vincentelli (1997)
Explicit and implicit algorithms for binate covering problemsIEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 16
-
R. Bayardo, R. Schrag (1997)
Using CSP Look-Back Techniques to Solve Real-World SAT Instances -
O. Coudert (1996)
On solving covering problems -
O. Coudert, Tsutomu Sasao (2001)
Two-level logic minimization -
Martin Davis, H. Putnam (1960)
A Computing Procedure for Quantification TheoryJ. ACM, 7
-
E. Goldberg, L. Carloni, T. Villa, R. Brayton, A. Sangiovanni-Vincentelli (1997)
Negative thinking by incremental problem solving: application to unate covering1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD)
-
G. Hachtel, F. Somenzi (1996)
Logic synthesis and verification algorithms -
Vasco Manquinho, P. Flores, Joao Marques-Silva, Arlindo Oliveira (1997)
Prime implicant computation using satisfiability algorithmsProceedings Ninth IEEE International Conference on Tools with Artificial Intelligence
-
C. Pizzuti (1996)
Computing prime implicants by integer programmingProceedings Eighth IEEE International Conference on Tools with Artificial Intelligence
- Publisher
- Springer Journals
- Copyright
- Copyright © 2004 by Kluwer Academic Publishers
- Subject
- Computer Science; Artificial Intelligence (incl. Robotics); Mathematics, general; Computer Science, general; Complex Systems
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1023/B:AMAI.0000012872.46214.11
- Publisher site
- See Article on Publisher Site
Abstract
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Computer Science and Engineering. In Artificial Intelligence, BCP can be used for computing minimum-size prime implicants of Boolean functions, of interest in Automated Reasoning and Non-Monotonic Reasoning. Moreover, Binate Covering is an essential modeling tool in Electronic Design Automation. The objectives of the paper are to briefly review branch-and-bound algorithms for BCP, to describe how to apply backtrack search pruning techniques from the Boolean Satisfiability (SAT) domain to BCP, and to illustrate how to strengthen those pruning techniques by exploiting the actual formulation of BCP. Experimental results, obtained on representative instances indicate that the proposed techniques provide significant performance gains for a large number of problem instances.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 5, 2004