J. Larrosa

Publications
Influence

Existential arc consistency: Getting closer to full arc consistency in weighted CSPs

S. D. Givry, F. Heras, M. Zytnicki, J. Larrosa
Mathematics, Computer Science
IJCAI
30 July 2005

The weighted CSP framework is a soft constraint framework with a wide range of applications. Expand

Solving weighted CSP by maintaining arc consistency

J. Larrosa, T. Schiex
Mathematics, Computer Science
Artif. Intell.
1 November 2004

We introduce a stronger form of arc consistency (AC*) along with two O(n2d2+ed3) algorithms. Expand

In the quest of the best form of local consistency for Weighted CSP

J. Larrosa, T. Schiex
Mathematics, Computer Science
IJCAI
9 August 2003

The weighted CSP (WCSP) framework is a soft constraint framework with a wide range of applications. Expand

Node and arc consistency in weighted CSP

J. Larrosa
Computer Science
AAAI/IAAI
28 July 2002

A general definition of arc consistency (AC) for soft constraint frameworks has been proposed (Schiex 2000). Expand

MiniMaxSAT: An Efficient Weighted Max-SAT solver

F. Heras, J. Larrosa, Albert Oliveras
Mathematics, Computer Science
J. Artif. Intell. Res.
2008

We introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MIN-ISAT+.It incorporates the best current SAT and Max-sAT techniques. Expand

On Forward Checking for Non-binary Constraint Satisfaction

C. Bessiere, P. Meseguer, Eugene C. Freuder, J. Larrosa
Computer Science
CP
11 October 1999

This paper focuses onthe well-known forward checking algorithm, and shows that it can begeneralized to several non-binary versions, all fitting its binarydefinition. Expand

Bucket elimination for multiobjective optimization problems

E. Rollon, J. Larrosa
Mathematics, Computer Science
J. Heuristics
1 September 2006

We extend bucket elimination (BE), a well known dynamic programming generic algorithm, from mono-objective to multiobjective optimization. Expand

Resolution in Max-SAT and its relation to local consistency in weighted CSPs

J. Larrosa, F. Heras
Mathematics, Computer Science
IJCAI
30 July 2005

Max-SAT is an optimization version of the well-known SAT problem. Expand

Maintaining Reversible DAC for Max-CSP

J. Larrosa, P. Meseguer, T. Schiex
Mathematics, Computer Science
Artif. Intell.
1999

We introduce an exact algorithm for maximizing the number of satisfied constraints in an overconstrained CSP (Max-CSP). Expand

MiniMaxSat: A New Weighted Max-SAT Solver

F. Heras, J. Larrosa, Albert Oliveras
Mathematics, Computer Science
SAT
28 May 2007

In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max- SAT techniques. Expand

Recommended Authors