#### Filter Results:

- Full text PDF available (178)

#### Publication Year

1991

2017

- This year (11)
- Last 5 years (92)
- Last 10 years (161)

#### 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)

- Mikolás Janota, William Klieber, Joao Marques-Silva, Edmund M. Clarke
- Artif. Intell.
- 2012

We propose two novel approaches for using CounterexampleGuided Abstraction Refinement (CEGAR) in Quantified Boolean Formula (QBF) solvers. The first approach develops a recursive algorithm whose search is driven by CEGAR (rather than by DPLL). The second approach employs CEGAR as an additional learning technique in an existing DPLL-based QBF solver.… (More)

- Joao Marques-Silva, Inês Lynce, Sharad Malik
- Handbook of Satisfiability
- 2009

One of the main reasons for the widespread use of SAT in many applications is that Conflict-Driven Clause Learning (CDCL) Boolean Satisfiability (SAT) solvers are so effective in practice. Since their inception in the mid-90s, CDCL SAT solvers have been applied, in many cases with remarkable success, to a number of practical applications. Examples of… (More)

- Lucas C. Cordeiro, Bernd Fischer, Joao Marques-Silva
- IEEE Transactions on Software Engineering
- 2009

Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structure during the translation. These limitations can be reduced by encoding word-level information in theories richer than propositional logic and using SMT solvers for the generated… (More)

- António Morgado, Federico Heras, Mark H. Liffiton, Jordi Planes, Joao Marques-Silva
- Constraints
- 2013

Maximum Satisfiability (MaxSAT) is an optimization version of SAT, and many real world applications can be naturally encoded as such. Solving MaxSAT is an important problem from both a theoretical and a practical point of view. In recent years, there has been considerable interest in developing efficient algorithms and several families of algorithms have… (More)

A set of constraints that cannot be simultaneously satisfied is over-constrained. Minimal relaxations and minimal explanations for over-constrained problems find many practical uses. For Boolean formulas, minimal relaxations of over-constrained problems are referred to as Minimal Correction Subsets (MCSes). MCSes find many applications, including the… (More)

- Mikolás Janota, Joao Marques-Silva
- Theor. Comput. Sci.
- 2015

This article introduces and studies a proof system ∀Exp+Res that enables us to refute quantified Boolean formulas (QBFs). The system ∀Exp+Res operates in two stages: it expands all universal variables through conjunctions and refutes the result by propositional resolution. This approach contrasts with the Q-resolution calculus, which enables refuting QBFs… (More)

- Federico Heras, António Morgado, Joao Marques-Silva
- AAAI
- 2011

Several MaxSAT algorithms based on iterative SAT solving have been proposed in recent years. These algorithms are in general the most efficient for real-world applications. Existing data indicates that, among MaxSAT algorithms based on iterative SAT solving, the most efficient ones are core-guided, i.e. algorithms which guide the search by iteratively… (More)

- Mikolás Janota, Joao Marques-Silva
- IJCAI
- 2015

Algorithms based on the enumeration of implicit hitting sets find a growing number of applications, which include maximum satisfiability and model based diagnosis, among others. This paper exploits enumeration of implicit hitting sets in the context of Quantified Boolean Formulas (QBF). The paper starts by developing a simple algorithm for QBF with two… (More)