Fadi A. Aloul, Arathi Ramani, Igot L. Markov, Karem A. Sakallah  Home/Search
Context Related
| umich.edu/~faloul/P...CSETR46102.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umich.edu/~faloul/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further uses are complicated by the need to express "counting constraints" in conjunctive normal form (CNF). Expressing such constraints by pure CNF leads to more complex SAT instances. Alternatively, those constraints can be handled by Integer Linear Programming (ILP), but generic ILP solvers may ignore the Boolean nature of 0-1 ... (Update)
Context of citations to this paper: More
.... some of them are based on branch and bound methods [14,7,6,16,15,13,20] and some of them are based on transforming MAX SAT into SAT [23,2]. Regarding the problems for formulas in CNF, most authors consider bounds with respect to three parameters: the length L of the input...
Cited by: More
Bounded Model Checking and Inductive Verification.. - Becker, Behle.. (2004) (Correct)
Exact Algorithms for MAX-SAT - Zhang, Shen, al. (2003) (Correct)
Efficient SAT engines for concise logics: Accelerating proof.. - Fränzle, Herde (2003) (Correct)
Active bibliography (related documents): More All
0.6: Robust SAT-Based Search Algorithm for Leakage Power.. - Aloul, Hassoun.. (2002) (Correct)
0.6: Solving Max-SAT as weighted CSP - de Givry, Larrosa, Meseguer, Schiex (Correct)
0.4: Symmetry-Breaking for Pseudo-Boolean Formulas - Aloul, Ramani, Markov, Sakallah (2003) (Correct)
Similar documents based on text: More All
0.6: Satometer: How Much Have We Searched? - Aloul, Sierawski, Sakallah (2002) (Correct)
0.4: SAT with Partial Clauses and Back-Leaps - Pilarski, Hu (2002) (Correct)
0.4: Solving Difficult Instances of Boolean Satisfiability .. - Aloul, Ramani.. (2002) (Correct)
Related documents from co-citation: More All
5: A fast pseudo-boolean constraint solver - Chai, Kuehlmann - 2003
3: Symbolic model checking without BDDs - Biere, Cimatti et al. - 1999
3: A Davis-Putnam based enumeration algorithm for linear pseudoBoolean optimization - Barth - 1995
BibTeX entry: (Update)
F.A. Aloul, A. Ramani, I.L. Markov, K.A. Sakallah, Generic ILP versus specialized 0-1 ILP: An update. Technical Report CSE-TR-461-02, University of Michigan, Ann Arbor, Michigan, Aug., 2002. http://citeseer.ist.psu.edu/aloul02generic.html More
@misc{ aloul02generic,
author = "F. Aloul and A. Ramani and I. Markov and K. Sakallah",
title = "Generic ILP versus specialized 0-1 ILP: An update",
text = "F.A. Aloul, A. Ramani, I.L. Markov, K.A. Sakallah, Generic ILP versus specialized
0-1 ILP: An update. Technical Report CSE-TR-461-02, University of Michigan,
Ann Arbor, Michigan, Aug., 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/aloul02generic.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
390 A Machine Program for Theorem Proving (context) - Davis, Logemann et al. - 1962
201 Parallel Prefix Computation (context) - Ladner, Fischer - 1980
144 Switching and Finite Automata Theory (context) - Kohavi - 1978
130 Chaff: Engineering an Efficient SAT Solver - Moskewicz, Madigan et al. - 2001
113 Test Pattern Generation Using Boolean Satisfiability - Larrabee - 1992
85 SATO: An Efficient Propositional Prover - Zhang - 1997
49 GRASP: A Search Algorithm for Propositional Satisfiability (context) - Marques-Silva, Sakallah - 1999
39 Boolean Reasoning (context) - Brown - 1990
32 Noise strategies for local search (context) - Selman, Kautz et al. - 1994
29 A Davis-Putnam based Enumeration Algorithm for Linear Pseudo.. - Barth - 1995
28 Efficient Conflict Driven Learning in a Boolean Satisfi- abi.. - Zhang, Madigan et al. - 2001
27 Effective use of Boolean Satisfiability Procedure in the For.. - Velev, Bryant - 2001
23 Using Randomization and Learning to Solve Hard Real-World In.. - Baptista, Marques-Silva - 2000
17 A Comparative Study of Two Boolean Formulations of FPGA Deta.. (context) - Nam, Aloul et al. - 2001
14 SATIRE: A New Incremental Satisfiability Engine (context) - Whittemore, Kim et al. - 2001
13 Complexity Classifications of Boolean Constraint Satisfactio.. (context) - Creignou, Kanna et al. - 2001
13 An efficient algorithm for unit-propagation - Zhang, Stickel - 1996
8 Solving Difficult SAT instances in the Presence of Symme- tr.. - Aloul, Ramani et al. - 2002
4 On Using Satisfiability-Based Pruning Techniques in Covering.. - Manquinho, Marques-Silva - 2000
3 Stochastic Systematic Search Algorithms for Satisfiability - Lynce, Baptista et al. - 2001
2 Solving Linear Pseudo-Boolean Constraint Problems with Local.. (context) - Walsor - 1997
2 sub-SAT: A Formulation for Relaxed Boolean Satisfiability wi.. (context) - Xu, Rutenbar et al. - 2002
1 A linear-time transformation of linear inequalities into con.. - Warners - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.eecs.umich.edu/~faloul/): More
MINCE: A Static Global Variable-Ordering for SAT and BDD - Aloul, Markov, Sakallah (2001) (Correct)
Efficient Verification of the PCI Local Bus using Boolean.. - Aloul, Sakallah (2000) (Correct)
Faster SAT and Smaller BDDs via Common Function Structure - Aloul, Markov, Sakallah (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC