Optimization-based Heuristics for Maximal Constraint Satisfaction. - Javier Larrosa; Pedro Meseguer (CP, 1995)

Constraint Satisfaction as Global Optimization. - Pedro Meseguer; Javier Larrosa (IJCAI (1), 1995)

A Framework for Abductive Rule Formation. - Javier Larrosa; Ulises Cortés (AI Commun., 1995)

Non-monotonic characterization of induction and its application to inductive learning. - Gustavo Núñez; Ulises Cortés; Javier Larrosa (Int. J. Intell. Syst., 1995)

Exploiting the Use of DAC in MAX-CSP. - Javier Larrosa; Pedro Meseguer (CP, 1996)

Phase Transition in MAX-CSP. - Javier Larrosa; Pedro Meseguer (ECAI, 1996)

Merging Constraint Satisfaction Subproblems to Avoid Redundant Search. - Javier Larrosa (IJCAI (1), 1997)

Reversible DAC and Other Improvements for Solving Max-CSP. - Javier Larrosa; Pedro Meseguer; Thomas Schiex; Gérard Verfaillie (AAAI/IAAI, 1998)

Partial Lazy Forward Checking for MAX-CSP. - Javier Larrosa; Pedro Meseguer (ECAI, 1998)

Generic CSP Techniques for the Job-Shop Problem. - Javier Larrosa; Pedro Meseguer (IEA/AIE (Vol. 2), 1998)

Maintaining Reversible DAC for Max-CSP. - Javier Larrosa; Pedro Meseguer; Thomas Schiex (Artif. Intell., 1999)

Boosting Search with Variable Elimination. - Javier Larrosa (CP, 2000)

A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. - Rina Dechter; Kalev Kask; Javier Larrosa (CP, 2001)

Lower Bounds for Non-binary Constraint Optimization Problems. - Pedro Meseguer; Javier Larrosa; Martí Sánchez-Fibla (CP, 2001)

Node and Arc Consistency in Weighted CSP. - Javier Larrosa (AAAI/IAAI, 2002)

Pseudo-tree Search with Soft Constraints. - Javier Larrosa; Pedro Meseguer; Martí Sánchez-Fibla (ECAI, 2002)

On forward checking for non-binary constraint satisfaction. - Christian Bessière; Pedro Meseguer; Eugene C. Freuder; Javier Larrosa (Artif. Intell., 2002)

Partition-Based Lower Bound for Max-CSP. - Javier Larrosa; Pedro Meseguer (Constraints An Int. J., 2002)

Constraint Satisfaction Algorithms for Graph Pattern Matching. - Javier Larrosa; Gabriel Valiente (Math. Struct. Comput. Sci., 2002)

Solving Max-SAT as Weighted CSP. - Simon de Givry; Javier Larrosa; Pedro Meseguer; Thomas Schiex (CP, 2003)

Solving 'Still Life' with Soft Constraints and Bucket Elimination. - Javier Larrosa; Enric Morancho (CP, 2003)

In the quest of the best form of local consistency for Weighted CSP. - Javier Larrosa; Thomas Schiex (IJCAI, 2003)

Algoritmos para Satisfacción de Restricciones. - Javier Larrosa; Pedro Meseguer (Inteligencia Artif., 2003)

Restricciones Blanda: Modelos y Algoritmos. - Javier Larrosa; Pedro Meseguer (Inteligencia Artif., 2003)

Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. - Javier Larrosa; Rina Dechter (Constraints An Int. J., 2003)

Improving the Applicability of Adaptive Consistency: Preliminary Results. - Martí Sánchez-Fibla; Pedro Meseguer; Javier Larrosa (CP, 2004)

Using Constraints with Memory to Implement Variable Elimination. - Martí Sánchez-Fibla; Pedro Meseguer; Javier Larrosa (ECAI, 2004)

Solving weighted CSP by maintaining arc consistency. - Javier Larrosa; Thomas Schiex (Artif. Intell., 2004)

Local Consistency in Weighted CSPs and Inference in Max-SAT. - Federico Heras; Javier Larrosa (CP, 2005)

Depth-First Mini-Bucket Elimination. - Emma Rollon; Javier Larrosa (CP, 2005)

Tree Decomposition with Function Filtering. - Martí Sánchez-Fibla; Javier Larrosa; Pedro Meseguer (CP, 2005)

Existential arc consistency: Getting closer to full arc consistency in weighted CSPs. - Simon de Givry; Federico Heras; Matthias Zytnicki; Javier Larrosa (IJCAI, 2005)

Resolution in Max-SAT and its relation to local consistency in weighted CSPs. - Javier Larrosa; Federico Heras (IJCAI, 2005)

Improving Tree Decomposition Methods With Function Filtering. - Martí Sánchez-Fibla; Javier Larrosa; Pedro Meseguer (IJCAI, 2005)

Unifying tree decompositions for reasoning in graphical models. - Kalev Kask; Rina Dechter; Javier Larrosa; Avi Dechter (Artif. Intell., 2005)

On the Practical use of Variable Elimination in Constraint Optimization Problems: 'Still-life' as a Case Study. - Javier Larrosa; Enric Morancho; David Niso (J. Artif. Intell. Res., 2005)

New Inference Rules for Efficient Max-SAT Solving. - Federico Heras; Javier Larrosa (AAAI, 2006)

Mini-bucket Elimination with Bucket Propagation. - Emma Rollon; Javier Larrosa (CP, 2006)

Multi-Objective Propagation in Constraint Programming. - Emma Rollon; Javier Larrosa (ECAI, 2006)

Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP. - Federico Heras; Javier Larrosa (J. Heuristics, 2006)

Bucket elimination for multiobjective optimization problems. - Emma Rollon; Javier Larrosa (J. Heuristics, 2006)

Multi-Objective Russian Doll Search. - Emma Rollon; Javier Larrosa (AAAI, 2007)

MiniMaxSat: A New Weighted Max-SAT Solver. - Federico Heras; Javier Larrosa; Albert Oliveras (SAT, 2007)

A Soft Approach to Multi-objective Optimization. - Stefano Bistarelli; Fabio Gadducci; Javier Larrosa; Emma Rollon (ICLP, 2008)

A Max-SAT Inference-Based Pre-processing for Max-Clique. - Federico Heras; Javier Larrosa (SAT, 2008)

A logical approach to efficient Max-SAT solving. - Javier Larrosa; Federico Heras; Simon de Givry (Artif. Intell., 2008)

MiniMaxSAT: An Efficient Weighted Max-SAT solver. - Federico Heras; Javier Larrosa; Albert Oliveras (J. Artif. Intell. Res., 2008)

2006 and 2007 Max-SAT Evaluations: Contributed Instances. - Federico Heras; Javier Larrosa; Simon de Givry; Thomas Schiex (J. Satisf. Boolean Model. Comput., 2008)

Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates. - Javier Larrosa; Robert Nieuwenhuis; Albert Oliveras; Enric Rodríguez-Carbonell (SAT, 2009)

Semiring-Induced Propositional Logic: Definition and Basic Algorithms. - Javier Larrosa; Albert Oliveras; Enric Rodríguez-Carbonell (LPAR (Dakar), 2010)

Extending Soft Arc Consistency Algorithms to Non-invertible Semirings. - Stefano Bistarelli; Fabio Gadducci; Javier Larrosa; Emma Rollon; Francesco Santini 001 (MICAI (1), 2010)

On Mini-Buckets and the Min-fill Elimination Ordering. - Emma Rollon; Javier Larrosa (CP, 2011)

A Framework for Certified Boolean Branch-and-Bound Optimization. - Javier Larrosa; Robert Nieuwenhuis; Albert Oliveras; Enric Rodríguez-Carbonell (J. Autom. Reason., 2011)

Improved Bounded Max-Sum for Distributed Constraint Optimization. - Emma Rollon; Javier Larrosa (CP, 2012)

Local arc consistency for non-invertible semirings, with an application to multi-objective optimization. - Stefano Bistarelli; Fabio Gadducci; Javier Larrosa; Emma Rollon; Francesco Santini 001 (Expert Syst. Appl., 2012)

Semiring-Based Mini-Bucket Partitioning Schemes. - Emma Rollon; Javier Larrosa; Rina Dechter (IJCAI, 2013)

Risk-neutral bounded max-sum for distributed constraint optimization. - Javier Larrosa; Emma Rollon (SAC, 2013)

Decomposing Utility Functions in Bounded Max-Sum for Distributed Constraint Optimization. - Emma Rollon; Javier Larrosa (CP, 2014)

Look-Ahead with Mini-Bucket Heuristics for MPE. - Rina Dechter; Kalev Kask; William Lam; Javier Larrosa (AAAI, 2016)

On the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds. - William Lam; Kalev Kask; Rina Dechter; Javier Larrosa (ECAI, 2016)

Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models. - Javier Larrosa; Emma Rollon; Rina Dechter (IJCAI, 2016)

Residual-Guided Look-Ahead in AND/OR Search for Graphical Models. - William Lam; Kalev Kask; Javier Larrosa; Rina Dechter (J. Artif. Intell. Res., 2017)

Subproblem ordering heuristics for AND/OR best-first search. - William Lam; Kalev Kask; Javier Larrosa; Rina Dechter (J. Comput. Syst. Sci., 2018)

Augmenting the Power of (Partial) MaxSat Resolution with Extension. - Javier Larrosa; Emma Rollon (AAAI, 2020)

Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems. - Javier Larrosa; Emma Rollon (SAT, 2020)

Choosing the Root of the Tree Decomposition When Solving WCSPs: Preliminary Results. - Aleksandra Petrova; Javier Larrosa; Emma Rollon (CCIA, 2021)

Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations. - Emma Rollon; Javier Larrosa (J. Log. Comput., 2022)

On Learning When to Decompose Graphical Models. - Aleksandra Petrova; Javier Larrosa (LION, 2023)

Theoretical and Empirical Analysis of Cost-Function Merging for Implicit Hitting Set WCSP Solving. - Javier Larrosa; Conrado Martínez; Emma Rollon (AAAI, 2024)

A Multi-Armed Bandit Approach Using Implicit Hitting Sets for Weighted CSPs. - Aleksandra Petrova; Javier Larrosa; Emma Rollon (CCIA, 2024)

An Adaptive Implicit Hitting Set Algorithm for MAP and MPE Inference. - Aleksandra Petrova; Javier Larrosa; Emma Rollon (PGM, 2024)

Empirical Evaluation of the Implicit Hitting Set Approach for Weighted CSPs. - Aleksandra Petrova; Javier Larrosa; Emma Rollon (CoRR, 2025)

Anytime Cooperative Implicit Hitting Set Solving. - Emma Rollon; Javier Larrosa; Aleksandra Petrova (CoRR, 2025)