#### Filter Results:

- Full text PDF available (151)

#### Publication Year

1985

2015

- This year (0)
- Last 5 years (9)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Joao Marques-Silva, Karem A. Sakallah
- IEEE Trans. Computers
- 1999

ÐThis paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques that proved to be quite powerful on a wide variety of SAT problems. Some of these techniques are specific to SAT, whereas others are similar in spirit to… (More)

- Joao Marques-Silva, Karem A. Sakallah
- Proceedings of International Conference on…
- 1996

This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed search-pruning techniques and facilitates identification of additional ones. GRASP is premised on the inevitability of conflicts during search and its most distinguishing feature is the… (More)

- Mark H. Liffiton, Karem A. Sakallah
- Journal of Automated Reasoning
- 2007

Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable “cores” from unsatisfiable constraint systems with the goal of finding minimal unsatisfiable subsets (MUSes). While most techniques have provided ways to find an approximation of an MUS (not necessarily minimal), we have developed a sound and… (More)

- Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah
- ICCAD
- 2002

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.… (More)

Optimized solvers for the Boolean Satisfiability (SAT) problem [5, 14, 15, 17, 19, 23, 24] found many applications in areas such as hardware and software verification, FPGA routing, planning in AI, etc. Further uses are complicated by the need to express “counting constraints” in conjunctive normal form (CNF). Expressing such constraints by pure CNF leads… (More)

- Hossein M. Sheini, Karem A. Sakallah
- JSAT
- 2006

This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization problems. To achieve this, we adopt the cutting-plane technique to draw inferences among PB constraints and combine it with generic implication graph analysis for conflictinduced… (More)

- Yoonna Oh, Maher N. Mneimneh, Zaher S. Andraus, Karem A. Sakallah, Igor L. Markov
- Proceedings. 41st Design Automation Conference…
- 2004

This paper describes a new algorithm for extracting unsatisfiable subformulas from a given unsatisfiable CNF formula. Such unsatisfiable "cores" can be very helpful in diagnosing the causes of infeasibility in large systems. Our algorithm is unique in that it adapts the "learning process" of a modern SAT solver to identify unsatisfiable subformulas rather… (More)

Research in algorithms for Boolean satisfiability and their implementations [23, 6] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks [10] can be solved in seconds on commodity PCs. More recent benchmarks take longer to solve because of their large size, but are still solved in minutes [25]. Yet, small and difficult SAT… (More)

We introduce SATIRE, a new satisfiability solver that is particular-ly suited to verification and optimization problems in electronic de-sign automation. SATIRE builds on the most recent advances in satisfiability research, and includes two new features to achieve even higher performance: a facility for incrementally solving sets of related problems, and… (More)

- Mark H. Liffiton, Karem A. Sakallah
- SAT
- 2005

Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the problem, strongly linking it to the maximal satisfiability problem. From this relationship, we have developed a novel technique for extracting all MUSes of a CNF formula, tightly… (More)