Sledovať
Jordi Coll
Jordi Coll
Universitat de Girona
Overená e-mailová adresa na: udg.edu
Názov
Citované v
Citované v
Rok
Combining clause learning and branch and bound for MaxSAT
CM Li, Z Xu, J Coll, F Manyà, D Habet, K He
27th International Conference on Principles and Practice of Constraint …, 2021
492021
SMT encodings for Resource-Constrained Project Scheduling Problems
M Bofill, J Coll, J Suy, M Villaret
Computers & Industrial Engineering 149, 106777, 2020
262020
Boosting branch-and-bound MaxSAT solvers with clause learning
CM Li, Z Xu, J Coll, F Manyà, D Habet, K He
AI Communications 35 (2), 131-151, 2022
212022
Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems.
M Bofill, J Coll, J Suy, M Villaret
IJCAI, 555-562, 2017
192017
Automatic detection of at-most-one and exactly-one relations for improved SAT encodings of pseudo-boolean constraints
C Ansótegui, M Bofill, J Coll, N Dang, JL Esteban, I Miguel, P Nightingale, ...
Principles and Practice of Constraint Programming: 25th International …, 2019
182019
Solving the multi-mode resource-constrained project scheduling problem with SMT
M Bofill, J Coll, J Suy, M Villaret
2016 IEEE 28th International Conference on Tools with Artificial …, 2016
182016
Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem
M Bofill, J Coll, M Garcia, J Giráldez-Cru, G Pesant, J Suy, M Villaret
Journal of Artificial Intelligence Research 74, 263-301, 2022
162022
SAT encodings of pseudo-boolean constraints with at-most-one relations
M Bofill, J Coll, J Suy, M Villaret
Integration of Constraint Programming, Artificial Intelligence, and …, 2019
132019
SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints
M Bofill, J Coll, P Nightingale, J Suy, F Ulrich-Oltean, M Villaret
Artificial Intelligence 302, 103604, 2022
122022
An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations
M Bofill, J Coll, J Suy, M Villaret
Artificial Intelligence Review 53, 5157-5188, 2020
92020
Towards lifted encodings for numeric planning in Essence Prime
J Espasa, J Coll, I Miguel, M Villaret
CP 2019 Workshop on Constraint Modelling and Reformulation, 2019
82019
An efficient SMT approach to solve MRCPSP/max instances with tight constraints on resources
M Bofill, J Coll, J Suy, M Villaret
Principles and Practice of Constraint Programming: 23rd International …, 2017
82017
Context-aware case-based reasoning
A Pla, J Coll, N Mordvaniuk, B López
Mining Intelligence and Knowledge Exploration: Second International …, 2014
82014
The Sample Analysis Machine Scheduling Problem: Definition and comparison of exact solving approaches
M Bofill, J Coll, G Martín, J Suy, M Villaret
Computers & Operations Research 142, 105730, 2022
42022
Intelligent systems for supporting premature babies healthcare with mobile devices
B López, J Coll, F Gamero, E BargallLó, A López-Bermejo
Mobilemed, 2013
42013
Context management in health care apps.
A Pla, B López, J Coll, N Mordvaniuk, A López-Bermejo
MIE, 1207, 2014
32014
MaxSAT resolution for regular propositional logic
J Coll, CM Li, F Manyà, E Yangin
International Journal of Approximate Reasoning 162, 109010, 2023
22023
A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers
S Li, CM Li, M Luo, J Coll, D Habet, F Manyà
32th International Joint Conferences on Artificial Intelligence (IJCAI 2023), 2023
22023
A Tableau Calculus for Signed Maximum Satisfiability
S Li, J Coll, D Habet, CM Li, F Manyà
2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL), 170-175, 2023
22023
A complete tableau calculus for the Regular MaxSAT problem
J Coll, CM Li, F Manyà, E Yangin
CCIA, 2023
22023
Systém momentálne nemôže vykonať operáciu. Skúste to neskôr.
Články 1–20