Segueix
Miquel Bofill Arasa
Miquel Bofill Arasa
Correu electrònic verificat a udg.edu - Pàgina d'inici
Títol
Citada per
Citada per
Any
The barcelogic SMT solver
M Bofill, R Nieuwenhuis, A Oliveras, E Rodríguez-Carbonell, A Rubio
Computer Aided Verification, 294-298, 2008
1352008
Solving constraint satisfaction problems with SAT modulo theories
M Bofill, M Palahí, J Suy, M Villaret
Constraints, 1-31, 2012
612012
Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem
C Ansótegui, M Bofill, M Palahı, J Suy, M Villaret
Resource 7 (3), 2, 2011
452011
Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers
C Ansótegui, M Bofill, F Manyà, M Villaret
2012 IEEE 42nd International Symposium on Multiple-Valued Logic, 25-30, 2012
352012
A System for solving constraint satisfaction problems with SMT
M Bofill, J Suy, M Villaret
Theory and Applications of Satisfiability Testing–SAT 2010, 300-305, 2010
342010
MaxSAT-based scheduling of B2B meetings
M Bofill, M Garcia, J Suy, M Villaret
Integration of AI and OR Techniques in Constraint Programming: 12th …, 2015
322015
A write-based solver for SAT modulo the theory of arrays
M Bofill, R Nieuwenhuis, A Oliveras, E Rodríguez-Carbonell, A Rubio
2008 Formal Methods in Computer-Aided Design, 1-8, 2008
252008
SIMPLY: a Compiler from a CSP Modeling Language to the SMT-LIB Format
M Bofill, M Palahı, J Suy, M Villaret
Proceedings of the 8th International Workshop on Constraint Modelling and …, 2009
232009
The RANTANPLAN planner: system description
M Bofill, J Espasa, M Villaret
The Knowledge Engineering Review 31 (5), 452-464, 2016
222016
New complexity results for Łukasiewicz logic
M Bofill, F Manyà, A Vidal, M Villaret
Soft Computing 23, 2187-2197, 2019
212019
SMT encodings for resource-constrained project scheduling problems
M Bofill, J Coll, J Suy, M Villaret
Computers & Industrial Engineering 149, 106777, 2020
202020
Finding hard instances of satisfiability in lukasiewicz logics
M Bofill, F Manya, A Vidal, M Villaret
2015 IEEE International Symposium on Multiple-Valued Logic, 30-35, 2015
192015
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
C Ansótegui, M Bofill, M Palahí, J Suy, M Villaret
Constraints 18, 236-268, 2013
192013
Resource analysis driven by (conditional) termination proofs
E Albert, M Bofill, C Borralleras, E Martin-Martin, A Rubio
Theory and Practice of Logic Programming 19 (5-6), 722-739, 2019
182019
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
172017
Scheduling B2B meetings
M Bofill, J Espasa, M Garcia, M Palahí, J Suy, M Villaret
Principles and Practice of Constraint Programming: 20th International …, 2014
172014
Paramodulation with Non-Monotonic Orderings and Simplification
M Bofill, A Rubio
Journal of Automated Reasoning, 1-48, 2011
172011
Paramodulation with non-monotonic orderings
M Bofill, G Godoy, R Nieuwenhuis, A Rubio
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999
171999
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
162019
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
162016
En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.
Articles 1–20