Linear Second-Order Unification and Context Unification with Tree-Regular Constraints. - Jordi Levy; Mateu Villaret (RTA, 2000)

Context Unification and Traversal Equations. - Jordi Levy; Mateu Villaret (RTA, 2001)

Parallelism and Tree Regular Constraints. - Joachim Niehren; Mateu Villaret (LPAR, 2002)

Currying Second-Order Unification Problems. - Jordi Levy; Mateu Villaret (RTA, 2002)

Monadic Second-Order Unification Is NP-Complete. - Jordi Levy; Manfred Schmidt-Schauß; Mateu Villaret (RTA, 2004)

Well-Nested Context Unification. - Jordi Levy; Joachim Niehren; Mateu Villaret (CADE, 2005)

Describing Lambda Terms in Context Unification. - Joachim Niehren; Mateu Villaret (LACL, 2005)

Stratified Context Unification Is NP-Complete. - Jordi Levy; Manfred Schmidt-Schauß; Mateu Villaret (IJCAR, 2006)

Bounded Second-Order Unification Is NP-Complete. - Jordi Levy; Manfred Schmidt-Schauß; Mateu Villaret (RTA, 2006)

Sequence Unification Through Currying. - Temur Kutsia; Jordi Levy; Mateu Villaret (RTA, 2007)

TILC: The Interactive Lambda-Calculus Tracer. - David Ruiz 003; Mateu Villaret (PROLE, 2008)

The Complexity of Monadic Second-Order Unification. - Jordi Levy; Manfred Schmidt-Schauß; Mateu Villaret (SIAM J. Comput., 2008)

Auction Robustness through Satisability Modulo Theories. - Miquel Bofill; Dídac Busquets; Mateu Villaret (WAT, 2009)

Simplifying the signature in second-order unification. - Jordi Levy; Mateu Villaret (Appl. Algebra Eng. Commun. Comput., 2009)

Experimental analysis of optimization techniques on the road passenger transportation problem. - Beatriz López 001; Víctor Muñoz; Javier Murillo; Federico Barber; Miguel A. Salido; Montserrat Abril; Mariamar Cervantes; Luis F. Caro; Mateu Villaret (Eng. Appl. Artif. Intell., 2009)

A declarative approach to robust weighted Max-SAT. - Miquel Bofill; Dídac Busquets; Mateu Villaret (PPDP, 2010)

An Efficient Nominal Unification Algorithm. - Jordi Levy; Mateu Villaret (RTA, 2010)

A System for Solving Constraint Satisfaction Problems with SMT. - Miquel Bofill; Josep Suy; Mateu Villaret (SAT, 2010)

On the relation between Context and Sequence Unification. - Temur Kutsia; Jordi Levy; Mateu Villaret (J. Symb. Comput., 2010)

Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic. - Carlos Ansótegui; Miquel Bofill; Felip Manyà; Mateu Villaret (ISMVL, 2011)

Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem. - Carlos Ansótegui; Miquel Bofill; Miquel Palahí; Josep Suy; Mateu Villaret (SARA, 2011)

On the complexity of Bounded Second-Order Unification and Stratified Context Unification. - Jordi Levy; Manfred Schmidt-Schauß; Mateu Villaret (Log. J. IGPL, 2011)

Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers. - Carlos Ansótegui; Miquel Bofill; Felip Manyà; Mateu Villaret (ISMVL, 2012)

Solving constraint satisfaction problems with SAT modulo theories. - Miquel Bofill; Miquel Palahí; Josep Suy; Mateu Villaret (Constraints An Int. J., 2012)

Nominal Unification from a Higher-Order Perspective. - Jordi Levy; Mateu Villaret (ACM Trans. Comput. Log., 2012)

A Variant of Higher-Order Anti-Unification. - Alexander Baumgartner; Temur Kutsia; Jordi Levy; Mateu Villaret (RTA, 2013)

Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories. - Carlos Ansótegui; Miquel Bofill; Miquel Palahí; Josep Suy; Mateu Villaret (Constraints An Int. J., 2013)

Reformulation based MaxSAT robustness. - Miquel Bofill; Dídac Busquets; Víctor Muñoz; Mateu Villaret (Constraints An Int. J., 2013)

A System for Generation and Visualization of Resource-Constrained Projects. - Miquel Bofill; Jordi Coll; Josep Suy; Mateu Villaret (CCIA, 2014)

Reformulation Based MaxSAT Robustness - (Extended Abstract). - Miquel Bofill; Dídac Busquets; Mateu Villaret (CP, 2014)

Scheduling B2B Meetings. - Miquel Bofill; Joan Espasa; Marc Garcia; Miquel Palahí; Josep Suy; Mateu Villaret (CP, 2014)

Solving Intensional Weighted CSPs by Incremental Optimization with BDDs. - Miquel Bofill; Miquel Palahí; Josep Suy; Mateu Villaret (CP, 2014)

Nominal Anti-Unification. - Alexander Baumgartner; Temur Kutsia; Jordi Levy; Mateu Villaret (UNIF, 2014)

Anti-unification for Unranked Terms and Hedges. - Temur Kutsia; Jordi Levy; Mateu Villaret (J. Autom. Reason., 2014)

MaxSAT-Based Scheduling of B2B Meetings. - Miquel Bofill; Marc Garcia; Josep Suy; Mateu Villaret (CPAIOR, 2015)

Finding Hard Instances of Satisfiability in Lukasiewicz Logics. - Miquel Bofill; Felip Manyà; Amanda Vidal; Mateu Villaret (ISMVL, 2015)

The Complexity of 3-Valued Łukasiewicz Rules. - Miquel Bofill; Felip Manyà; Amanda Vidal; Mateu Villaret (MDAI, 2015)

Fuzzy XPath for the Automatic Search of Fuzzy Formulae Models. - Jesús Manuel Almendros-Jiménez; Miquel Bofill; Alejandro Luna Tedesqui; Ginés Moreno; Carlos Vázquez; Mateu Villaret (SUM, 2015)

SAT and SMT Technology for Many-Valued Logics. - Carlos Ansótegui; Miquel Bofill; Felip Manyà; Mateu Villaret (J. Multiple Valued Log. Soft Comput., 2015)

A Semantic Notion of Interference for Planning Modulo Theories. - Miquel Bofill; Joan Espasa; Mateu Villaret (ICAPS, 2016)

Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with SMT. - Miquel Bofill; Jordi Coll; Josep Suy; Mateu Villaret (ICTAI, 2016)

Nominal Unification of Higher Order Expressions with Recursive Let. - Manfred Schmidt-Schauß; Temur Kutsia; Jordi Levy; Mateu Villaret (LOPSTR, 2016)

Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers. - Carlos Ansótegui; Miquel Bofill; Felip Manyà; Mateu Villaret (Fuzzy Sets Syst., 2016)

The RANTANPLAN planner: system description. - Miquel Bofill; Joan Espasa; Mateu Villaret (Knowl. Eng. Rev., 2016)

The Spanish Kidney Exchange Model: Study of Computation-Based Alternatives to the Current Procedure. - Miquel Bofill; Marcos Calderón; Francesc Castro; Esteve del Acebo; Pablo Delgado; Marc Garcia; Marta García; Marc Roig; María O. Valentín; Mateu Villaret (AIME, 2017)

An Efficient SMT Approach to Solve MRCPSP/max Instances with Tight Constraints on Resources. - Miquel Bofill; Jordi Coll; Josep Suy; Mateu Villaret (CP, 2017)

Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems. - Miquel Bofill; Jordi Coll; Josep Suy; Mateu Villaret (IJCAI, 2017)

Relaxed Exists-Step Plans in Planning as SMT. - Miquel Bofill; Joan Espasa; Mateu Villaret (IJCAI, 2017)

Higher-Order Pattern Anti-Unification in Linear Time. - Alexander Baumgartner; Temur Kutsia; Jordi Levy; Mateu Villaret (J. Autom. Reason., 2017)

Term-Graph Anti-Unification. - Alexander Baumgartner; Temur Kutsia; Jordi Levy; Mateu Villaret (FSCD, 2018)

A Study on Implied Constraints in a MaxSAT Approach to B2B Problems. - Miquel Bofill; Jesús Giráldez-Cru; Josep Suy; Mateu Villaret (CCIA, 2019)

Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. - Carlos Ansótegui; Miquel Bofill; Jordi Coll; Nguyen Dang 001; Juan Luis Esteban; Ian Miguel; Peter Nightingale; András Z. Salamon; Josep Suy; Mateu Villaret (CP, 2019)

SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations. - Miquel Bofill; Jordi Coll; Josep Suy; Mateu Villaret (CPAIOR, 2019)

New complexity results for Łukasiewicz logic. - Miquel Bofill; Felip Manyà; Amanda Vidal; Mateu Villaret (Soft Comput., 2019)

An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations. - Miquel Bofill; Jordi Coll; Josep Suy; Mateu Villaret (Artif. Intell. Rev., 2020)

SMT encodings for Resource-Constrained Project Scheduling Problems. - Miquel Bofill; Jordi Coll; Josep Suy; Mateu Villaret (Comput. Ind. Eng., 2020)

Exploring Lifted Planning Encodings in Essence Prime. - Joan Espasa; Jordi Coll; Ian Miguel; Mateu Villaret (CCIA, 2021)

A Preliminary Case Study of Planning With Complex Transitions: Plotting. - Jordi Coll; Joan Espasa; Ian Miguel; Mateu Villaret (CoRR, 2021)

Relaxing non-interference requirements in parallel plans. - Miquel Bofill; Joan Espasa; Mateu Villaret (Log. J. IGPL, 2021)

Plotting: A Planning Problem with Complex Transitions. - Joan Espasa; Ian Miguel; Mateu Villaret (CP, 2022)

SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints. - Miquel Bofill; Jordi Coll; Peter Nightingale; Josep Suy; Felix Ulrich-Oltean; Mateu Villaret (Artif. Intell., 2022)

The Sample Analysis Machine Scheduling Problem: Definition and comparison of exact solving approaches. - Miquel Bofill; Jordi Coll; Gerard Martín; Josep Suy; Mateu Villaret (Comput. Oper. Res., 2022)

Nominal Unification and Matching of Higher Order Expressions with Recursive Let. - Manfred Schmidt-Schauß; Temur Kutsia; Jordi Levy; Mateu Villaret; Yunus D. K. Kutz (Fundam. Informaticae, 2022)

The Impact of Implied Constraints on MaxSAT B2B Instances. - Miquel Bofill; Jordi Coll; Jesús Giráldez-Cru; Josep Suy; Mateu Villaret (Int. J. Comput. Intell. Syst., 2022)

New Reasoning Models: Improving Optimisation and Decision Support with the Management of Uncertainty and Constraints. - Aïda Valls; Cèsar Fernández; Mateu Villaret (Int. J. Comput. Intell. Syst., 2022)

Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem. - Miquel Bofill; Jordi Coll; Marc Garcia; Jesús Giráldez-Cru; Gilles Pesant; Josep Suy; Mateu Villaret (J. Artif. Intell. Res., 2022)

SAT-IT: The Interactive SAT Tracer. - Marc Cané; Jordi Coll; Marc Rojo; Mateu Villaret (CCIA, 2023)

Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem (Extended Abstract). - Miquel Bofill; Jordi Coll; Marc Garcia; Jesús Giráldez-Cru; Gilles Pesant; Josep Suy; Mateu Villaret (IJCAI, 2023)

SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints (Extended Abstract). - Miquel Bofill; Jordi Coll; Peter Nightingale; Josep Suy; Felix Ulrich-Oltean; Mateu Villaret (IJCAI, 2023)

On Grid Graph Reachability and Puzzle Games. - Miquel Bofill; Cristina Borralleras; Joan Espasa; Mateu Villaret (CoRR, 2023)

Challenges in Modelling and Solving Plotting with PDDL. - Joan Espasa; Ian Miguel; Peter Nightingale; András Z. Salamon; Mateu Villaret (CoRR, 2023)

A Good Snowman is Hard to Plan. - Miquel Bofill; Cristina Borralleras; Joan Espasa; Gerard Martín; Gustavo Patow; Mateu Villaret (CoRR, 2023)

Towards a Model of Puzznic. - Joan Espasa; Ian P. Gent; Ian Miguel; Peter Nightingale; András Z. Salamon; Mateu Villaret (CoRR, 2023)

Cross-Paradigm Modelling: A Study of Puzznic. - Joan Espasa; Ian P. Gent; Ian Miguel; Peter Nightingale; András Z. Salamon; Mateu Villaret (ICTAI, 2024)

Optimizing resource allocation in home care services using MaxSAT. - Irene Unceta; Bernat Salbanya; Jordi Coll; Mateu Villaret; Jordi Nin (Cogn. Syst. Res., 2024)

Plotting: a case study in lifted planning with constraints. - Joan Espasa; Ian Miguel; Peter Nightingale; András Z. Salamon; Mateu Villaret (Constraints An Int. J., 2024)