Larrosa, Javier - Departament of Llenguatges i Sistemes Informátics, Universitat Politècnica de Catalunya

• Solving Weighted CSP by Maintaining Arc Consistency
• PseudoTree Search with Soft Constraints Javier Larrosa 1 and Pedro Meseguer 2 and Mart S anchez 3
• Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. \Lambda
• On the Dual Representation of Nonbinary Semiringbased CSPs ?
• Resolution in Max-SAT and its relation to local consistency in weighted CSPs Javier Larrosa, Federico Heras
• ACCOMMODATION CSCLP 2009-Annual ERCIM Workshop on Constraint Solving and Constraint Logic
• Solving Max-SAT as weighted CSP ? Simon de Givry 1 , Javier Larrosa 2 , Pedro Meseguer 3 , and Thomas Schiex 1
• DepthFirst MiniBucket Elimination Emma Rollon and Javier Larrosa
• Intelligent variable orderings and reorderings in DACbased solvers for WCSP #
• PartitionBased Lower Bound for MaxCSP \Lambda A. Javier Larrosa (larrosa@lsi.upc.es)
• New Inference Rules for Efficient Max-SAT Solving Federico Heras and Javier Larrosa
• A General Scheme for Multiple Lower Bound Computation in Constraint Optimization ?
• Lower Bounds for Non-binary Constraint Optimization Problems ?
• Node and Arc Consistency in Weighted CSP Javier Larrosa
• Asynchronous Branch & Bound and A* for DisWCSPs, with heuristic function based on
• Existential arc consistency: Getting closer to full arc consistency in weighted CSPs
• Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
• Current trends in Max-SAT solving
• This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and
• Journal of Artificial Intelligence Research 23 (2005) 421-440 Submitted 07/04; published 04/05 On the Practical use of Variable Elimination in Constraint
• Using Constraints with Memory to Implement Variable Elimination
• Algoritmos para Satisfacci'on de Restricciones Javier Larrosa Pedro Meseguer
• MiniMaxSat: An efficient Weighted MaxSAT Solver # Federico Heras, Javier Larrosa, and Albert Oliveras
• MultiObjective Propagation in Constraint Programming Emma Rollon and Javier Larrosa 1
• On the Practical use of Variable Elimination in Constraint Optimization
• Restricciones Blandas: Modelos y Algoritmos Javier Larrosa Pedro Meseguer
• HOTEL RESERVATION FORM CSCLP 2009-Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming
• Turning SAT Modulo Theories into a Happy Marriage Between SAT and CP
• Identification of Minimal Nonredundant Biomarkers in Medical Data Analysis
• Introduction to Constraint Programming Basic Definitions
• Comet Tutorial Dynamic Decision Technologies Inc.
• Solving SAT and SAT Modulo Theories: From an Abstract DavisPutnamLogemannLoveland Procedure to DPLL(T)
• Introduction to Constraint Programming Local Consistency
• Introduction to Constraint Programming Arc-consistency for non-binary constraints
• Introduction to Constraint Programming: Basic Modeling with Comet
• Introduction to Constraint Programming: Tuning the search with Comet
• Problem Solving and Constraint Programming PUBLICATION OF GRADES: (on the web) January 10th
• Problem Solving and Constraint Programming PUBLICATION OF GRADES: (on the web) January 16th