#### Filter Results:

- Full text PDF available (75)

#### Publication Year

1961

2017

- This year (3)
- Last 5 years (23)
- Last 10 years (49)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
- SAT
- 2009

Recently, Fu and Malik described an unweighted Partial MaxSAT solver based on successive calls to a SAT solver. At the kth iteration the SAT solver tries to certify that there exist an assignment that satisfies all but k clauses. Later Marques-Silva and Planes implemented and extended these ideas. In this paper we present and implement two Partial MaxSAT… (More)

- Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
- Artif. Intell.
- 2013

Article history: Received 19 June 2012 Received in revised form 3 January 2013 Accepted 13 January 2013 Available online 21 January 2013

- Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
- AAAI
- 2010

We present and implement aWeighted Partial MaxSAT solver based on successive calls to a SAT solver. We prove the correctness of our algorithm and compare our solver with other Weighted Partial MaxSAT solvers.

- Maria Luisa Bonet, Jordi Levy, Felip Manyà
- Artif. Intell.
- 2007

Max-SAT is the problem of finding an assignment minimizing the number of unsatisfied clauses in a CNF formula. We propose a resolution-like calculus for Max-SAT and prove its soundness and completeness. We also prove the completeness of some refinements of this calculus. From the completeness proof we derive an exact algorithm for Max-SAT and a time upper… (More)

- Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà
- AAAI
- 2008

The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research question. Among others, the space complexity of treelike resolution (also called hardness), the minimal size of strong backdoors and of cycle-cutsets, and the treewidth can be used for this purpose. We propose the use of the tree-like… (More)

- Jordi Levy, Jaume Agustí-Cullell
- RTA
- 1993

We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ −→ and rewriting a to b, we use another rewriting relation ⊇ −→ as well and seek a common expression c such that a ⊆ −→ ∗ c and b ⊇ −→ ∗ c. Each component of the bi-rewriting system 〈… (More)

- Jordi Levy
- RTA
- 1996

We present a new class of second-order unification problems, which we have called linear. We deal with completely general second-order typed unification problems, but we restrict the set of unifiers under consideration: they instantiate free variables by linear terms, i.e. terms where any λ-abstractions bind one and only one occurrence of a bound variable.… (More)

- Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy
- SAT
- 2012

The research community on complex networks has developed techniques of analysis and algorithms that can be used by the SAT community to improve our knowledge about the structure of industrial SAT instances. It is often argued that modern SAT solvers are able to exploit this hidden structure, without a precise definition of this notion. In this paper, we… (More)

In the last few years, there has been a significant effort in designing and developing efficient Weighted MaxSAT solvers. We study in detail the WPM1 algorithm identifying some weaknesses and proposing solutions to mitigate them. Basically, WPM1 is based on iteratively calling a SAT solver and adding blocking variables and cardinality constraints to relax… (More)

- Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy
- IJCAI
- 2009

We focus on the random generation of SAT instances that have computational properties that are similar to real-world instances. It is known that industrial instances, even with a great number of variables, can be solved by a clever solver in a reasonable amount of time. This is not possible, in general, with classical randomly generated instances. We… (More)