#### Filter Results:

- Full text PDF available (87)

#### Publication Year

2001

2017

- This year (2)
- Last 5 years (34)
- Last 10 years (82)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

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

- Inês Lynce, Joël Ouaknine
- ISAIM
- 2006

Sudoku is a very simple and well-known puzzle that has achieved international popularity in the recent past. This paper addresses the problem of encoding Sudoku puzzles into conjunctive normal form (CNF), and subsequently solving them using polynomial-time propositional satisfiability (SAT) inference techniques. We introduce two straightforward SAT… (More)

- Inês Lynce, Joao Marques-Silva
- SAT
- 2004

Certifying a SAT solver for unsatisfiable instances is a computationally hard problem. Nevertheless, in the utilization of SAT in industrial settings, one often needs to be able to generate unsatisfiability proofs, either to guarantee the correctness of the SAT solver or as part of the utilization of SAT in some applications (e.g. in model checking). As… (More)

- Joao Marques-Silva, Inês Lynce
- CP
- 2007

Motivated by the performance improvements made to SAT solvers in recent years, a number of different encodings of constraints into SAT have been proposed. Concrete examples are the different SAT encodings for ≤ 1 (x1, . . . , xn) constraints. The most widely used encoding is known as the pairwise encoding, which is quadratic in the number of variables in… (More)

- Inês Lynce, Joao Marques-Silva
- AAAI
- 2006

One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technological limitations, genotype data rather than haplotype data is usually obtained. The haplotype inference by pure parsimony (HIPP) problem consists in inferring haplotypes from… (More)

- Anton Belov, Inês Lynce, Joao Marques-Silva
- AI Commun.
- 2012

Minimally Unsatisfiable Subformulas (MUS) find a wide range of practical applications, including product configuration, knowledge-based validation, and hardware and software design and verification. MUSes also find application in recent Maximum Satisfiability algorithms and in CNF formula redundancy removal. Besides direct applications in Propositional… (More)

- Ruben Martins, Vasco M. Manquinho, Inês Lynce
- SAT
- 2014

This paper presents OPEN-WBO, a new MaxSAT solver. OPEN-WBO has two main features. First, it is an open-source solver that can be easily modified and extended. Most MaxSAT solvers are not available in open-source, making it hard to extend and improve current MaxSAT algorithms. Second, OPENWBO may use any MiniSAT-like solver as the underlying SAT solver. As… (More)

- Joao Marques-Silva, Mikolás Janota, Inês Lynce
- ECAI
- 2010

Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreover, backbones find other applications. For example, backbones are often identified during product configuration. Backbones can also improve the efficiency of solving… (More)

- Ruben Martins, Vasco M. Manquinho, Inês Lynce
- 2010 22nd IEEE International Conference on Tools…
- 2010

The last two decades progresses have led Propositional Satisfiability (SAT) to be a competitive practical approach to solve a wide range of industrial and academic problems. Thanks to these advances, the size and difficulty of the SAT instances have grown significantly. The demand for more computational power led to the creation of new computer… (More)

Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible using existing technology. One of the methods for solving this problem uses the pure parsimony criterion, an approach known as Haplotype Inference by Pure Parsimony (HIPP). Initial work in… (More)