Share This Author
GRASP: A Search Algorithm for Propositional Satisfiability
Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances.
GRASP-A new search algorithm for satisfiability
Experimental results obtained from a large number of benchmarks, including many from the field of test pattern generation, indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances.
Solving QBF with Counterexample Guided Refinement
Two promising avenues in QBF are opened: CEGAR-driven solvers as an alternative to existing approaches and a novel type of learning in DPLL.
Conflict-Driven Clause Learning SAT Solvers
This chapter describes the ingredients of conflict-driven clause learning SAT solvers, namely conflict analysis, lazy data structures, search restarts, conflict- driven heuristics and clause deletion strategies.
SMT-Based Bounded Model Checking for Embedded ANSI-C Software
- L. Cordeiro, B. Fischer, Joao Marques-Silva
- Computer ScienceIEEE Transactions on Software Engineering
- 12 July 2009
This work proposes the application of different background theories and SMT solvers to the verification of embedded software written in ANSI-C in order to improve scalability and precision in a completely automatic way and shows that the ESBMC model checker can analyze larger problems than existing tools and substantially reduce the verification time.
Solving QBF by Clause Selection
A novel QBF algorithm is developed, which generalizes the concept of enumeration of implicit hitting sets and is competitive with, and often outperforms, the state of the art in QBF solving.
On Computing Minimal Correction Subsets
- Joao Marques-Silva, F. Heras, Mikoláš Janota, Alessandro Previti, A. Belov
- Computer ScienceIJCAI
- 3 August 2013
A number of novel techniques for improving the performance of existing MCS computation algorithms are developed and a novel algorithm is proposed for computing MCSes, which is shown to yield the most efficient and robust solutions for M CS computation.
Fast, flexible MUS enumeration
- Mark H. Liffiton, Alessandro Previti, Ammar Malik, Joao Marques-Silva
- Computer ScienceConstraints
- 1 April 2016
This paper unifies and expands upon the earlier work, presenting a detailed explanation of the algorithm’s operation in a framework that also enables clearer comparisons to previous approaches, and presenting a new optimization ofThe algorithm as well.
Expansion-based QBF solving versus Q-resolution
Algorithms for Weighted Boolean Optimization
Weighted Boolean Optimization (WBO) is proposed, a new unified framework that aggregates and extends PBO and MaxSAT and a new unsatisfiability-based algorithm for WBO, based on recent unsatisfiable algorithms for MaxSat.