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

Intelligent System for Premature Babies Healthcare at Home based on Case-based Reasoning. - Beatriz López 001; Francisco Gamero; Jordi Coll; Natalia Mordvaniuk; Judit Bassols; Eva Bargallo; Borja Guarch; Abel López-Bermejo (IWBBIO, 2014)

Context Management in Health Care Apps. - Albert Pla; Beatriz López 001; Jordi Coll; Natalia Mordvaniuk; Abel López-Bermejo (MIE, 2014)

Context-Aware Case-Based Reasoning. - Albert Pla; Jordi Coll; Natalia Mordvaniuk; Beatriz López 001 (MIKE, 2014)

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

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)

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)

Scheduling through logic-based tools. - Jordi Coll (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)

Combining Clause Learning and Branch and Bound for MaxSAT. - Chu-Min Li 001; Zhenxing Xu; Jordi Coll; Felip Manyà; Djamal Habet; Kun He 001 (CP, 2021)

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

A Tableau Calculus for MaxSAT Based on Resolution. - Shoulin Li; Jordi Coll; Djamal Habet; Chu-Min Li 001; Felip Manyà (CCIA, 2022)

Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract). - Chu-Min Li 001; Zhenxing Xu; Jordi Coll; Felip Manyà; Djamal Habet; Kun He 001 (IJCAI, 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)

Boosting branch-and-bound MaxSAT solvers with clause learning. - Chu-Min Li 001; Zhenxing Xu; Jordi Coll; Felip Manyà; Djamal Habet; Kun He 001 (AI Commun., 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)

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)

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)

A Complete Tableau Calculus for the Regular MaxSAT Problem. - Jordi Coll; Chu-Min Li 001; Felip Manyà; Elifnaz Yangin (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)

A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers. - Shuolin Li; Chu-Min Li 001; Mao Luo; Jordi Coll; Djamal Habet; Felip Manyà (IJCAI, 2023)

A Tableau Calculus for Signed Maximum Satisfiability. - Shuolin Li; Jordi Coll; Djamal Habet; Chu Min Li 001; Felip Manyà (ISMVL, 2023)

Scheduling through logic-based tools. - Jordi Coll Caballero (Constraints An Int. J., 2023)

MaxSAT resolution for regular propositional logic. - Jordi Coll; Chu-Min Li 001; Felip Manyà; Elifnaz Yangin (Int. J. Approx. Reason., 2023)

A Complete Tableau Calculus for Non-Clausal Regular MinSAT. - Jordi Coll; Chu Min Li 001; Felip Manyà; Elifnaz Yangin (CCIA, 2024)

A Tableau Calculus for Non-Clausal Regular MaxSAT. - Jordi Coll; Chu Min Li 001; Felip Manyà; Elifnaz Yangin (ISMVL, 2024)

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

Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT. - Shuolin Li; Chu-Min Li 001; Jordi Coll; Djamal Habet; Felip Manyà (AAAI, 2025)

A Complete Tableau Calculus for Signed MaxSAT. - Jordi Coll; Chu Min Li 001; Felip Manyà; Elifnaz Yangin (ISMVL, 2025)

Complete tableau calculi for Regular MaxSAT and Regular MinSAT. - Jordi Coll; Chu Min Li 001; Felip Manyà; Elifnaz Yangin (Cogn. Syst. Res., 2025)

Solving weighted Maximum Satisfiability with Branch and Bound and clause learning. - Jordi Coll; Chu Min Li 001; Shuolin Li; Djamal Habet; Felip Manyà (Comput. Oper. Res., 2025)