Miquel Bofill - RankMe

57 papers A* 8A 8B 6C 1Journal 25Unranked 9

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	A Good Snowman is Hard to Plan. CoRR Miquel Bofill, Cristina Borralleras, Joan Espasa, Gerard Martín, Gustavo Patow, Mateu Villaret
2023	A*	`conf`	Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem (Extended Abstract). IJCAI Miquel Bofill, Jordi Coll, Marc Garcia, Jesús Giráldez-Cru, Gilles Pesant, Josep Suy, Mateu Villaret
2023	J	`jnl`	On Grid Graph Reachability and Puzzle Games. CoRR Miquel Bofill, Cristina Borralleras, Joan Espasa, Mateu Villaret
2023	A*	`conf`	SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints (Extended Abstract). IJCAI Miquel Bofill, Jordi Coll, Peter Nightingale, Josep Suy, Felix Ulrich-Oltean, Mateu Villaret
2022	J	`jnl`	Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem. J. Artif. Intell. Res. Miquel Bofill, Jordi Coll, Marc Garcia, Jesús Giráldez-Cru, Gilles Pesant, Josep Suy, Mateu Villaret
2022	J	`jnl`	SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints. Artif. Intell. Miquel Bofill, Jordi Coll, Peter Nightingale, Josep Suy, Felix Ulrich-Oltean, Mateu Villaret
2022	J	`jnl`	The Impact of Implied Constraints on MaxSAT B2B Instances. Int. J. Comput. Intell. Syst. Miquel Bofill, Jordi Coll, Jesús Giráldez-Cru, Josep Suy, Mateu Villaret
2022	J	`jnl`	The Sample Analysis Machine Scheduling Problem: Definition and comparison of exact solving approaches. Comput. Oper. Res. Miquel Bofill, Jordi Coll, Gerard Martín, Josep Suy, Mateu Villaret
2021	J	`jnl`	Relaxing non-interference requirements in parallel plans. Log. J. IGPL Miquel Bofill, Joan Espasa, Mateu Villaret
2021	J	`jnl`	SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints. CoRR Miquel Bofill, Jordi Coll, Peter Nightingale, Josep Suy, Felix Ulrich-Oltean, Mateu Villaret
2020	J	`jnl`	An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations. Artif. Intell. Rev. Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret
2020	J	`jnl`	SMT encodings for Resource-Constrained Project Scheduling Problems. Comput. Ind. Eng. Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret
2019	—	`conf`	A Study on Implied Constraints in a MaxSAT Approach to B2B Problems. CCIA Miquel Bofill, Jesús Giráldez-Cru, Josep Suy, Mateu Villaret
2019	A	`conf`	Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. CP Carlos Ansótegui, Miquel Bofill, Jordi Coll, Nguyen Dang, Juan Luis Esteban, Ian Miguel, Peter Nightingale, András Z. Salamon, Josep Suy, Mateu Villaret
2019	J	`jnl`	New complexity results for Łukasiewicz logic. Soft Comput. Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret
2019	J	`jnl`	Resource Analysis driven by (Conditional) Termination Proofs. CoRR Elvira Albert, Miquel Bofill, Cristina Borralleras, Enrique Martin-Martin, Albert Rubio
2019	J	`jnl`	Resource Analysis driven by (Conditional) Termination Proofs. Theory Pract. Log. Program. Elvira Albert, Miquel Bofill, Cristina Borralleras, Enrique Martin-Martin, Albert Rubio
2019	B	`conf`	SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations. CPAIOR Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret
2017	A	`conf`	An Efficient SMT Approach to Solve MRCPSP/max Instances with Tight Constraints on Resources. CP Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret
2017	A*	`conf`	Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems. IJCAI Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret
2017	A*	`conf`	Relaxed Exists-Step Plans in Planning as SMT. IJCAI Miquel Bofill, Joan Espasa, Mateu Villaret
2017	B	`conf`	The Spanish Kidney Exchange Model: Study of Computation-Based Alternatives to the Current Procedure. AIME 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
2016	A*	`conf`	A Semantic Notion of Interference for Planning Modulo Theories. ICAPS Miquel Bofill, Joan Espasa, Mateu Villaret
2016	J	`jnl`	Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers. Fuzzy Sets Syst. Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
2016	B	`conf`	Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with SMT. ICTAI Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret
2016	J	`jnl`	Solving the Wastewater Treatment Plant Problem with SMT. CoRR Miquel Bofill, Víctor Muñoz, Javier Murillo
2016	J	`jnl`	The RANTANPLAN planner: system description. Knowl. Eng. Rev. Miquel Bofill, Joan Espasa, Mateu Villaret
2015	J	`jnl`	Automatic Proving of Fuzzy Formulae with Fuzzy Logic Programming and SMT. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Miquel Bofill, Ginés Moreno, Carlos Vázquez, Mateu Villaret
2015	—	`conf`	Finding Hard Instances of Satisfiability in Lukasiewicz Logics. ISMVL Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret
2015	—	`conf`	Fuzzy XPath for the Automatic Search of Fuzzy Formulae Models. SUM Jesús Manuel Almendros-Jiménez, Miquel Bofill, Alejandro Luna Tedesqui, Ginés Moreno, Carlos Vázquez, Mateu Villaret
2015	B	`conf`	MaxSAT-Based Scheduling of B2B Meetings. CPAIOR Miquel Bofill, Marc Garcia, Josep Suy, Mateu Villaret
2015	J	`jnl`	SAT and SMT Technology for Many-Valued Logics. J. Multiple Valued Log. Soft Comput. Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
2015	B	`conf`	The Complexity of 3-Valued Łukasiewicz Rules. MDAI Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret
2014	—	`conf`	A System for Generation and Visualization of Resource-Constrained Projects. CCIA Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret
2014	A	`conf`	Reformulation Based MaxSAT Robustness - (Extended Abstract). CP Miquel Bofill, Dídac Busquets, Mateu Villaret
2014	A	`conf`	Scheduling B2B Meetings. CP Miquel Bofill, Joan Espasa, Marc Garcia, Miquel Palahí, Josep Suy, Mateu Villaret
2014	A	`conf`	Solving Intensional Weighted CSPs by Incremental Optimization with BDDs. CP Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret
2013	J	`jnl`	Paramodulation with Non-Monotonic Orderings and Simplification. J. Autom. Reason. Miquel Bofill, Albert Rubio
2013	J	`jnl`	Reformulation based MaxSAT robustness. Constraints An Int. J. Miquel Bofill, Dídac Busquets, Víctor Muñoz, Mateu Villaret
2013	J	`jnl`	Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories. Constraints An Int. J. Carlos Ansótegui, Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret
2013	J	`jnl`	The recursive path and polynomial ordering for first-order and higher-order terms. J. Log. Comput. Miquel Bofill, Cristina Borralleras, Enric Rodríguez-Carbonell, Albert Rubio
2012	—	`conf`	Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers. ISMVL Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
2012	J	`jnl`	Solving constraint satisfaction problems with SAT modulo theories. Constraints An Int. J. Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret
2011	—	`conf`	Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic. ISMVL Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret
2011	—	`conf`	Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem. SARA Carlos Ansótegui, Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret
2010	A	`conf`	A System for Solving Constraint Satisfaction Problems with SMT. SAT Miquel Bofill, Josep Suy, Mateu Villaret
2010	C	`conf`	A declarative approach to robust weighted Max-SAT. PPDP Miquel Bofill, Dídac Busquets, Mateu Villaret
2009	—	`conf`	Auction Robustness through Satisability Modulo Theories. WAT Miquel Bofill, Dídac Busquets, Mateu Villaret
2009	J	`jnl`	Paramodulation with Well-founded Orderings. J. Log. Comput. Miquel Bofill, Albert Rubio
2008	B	`conf`	A Write-Based Solver for SAT Modulo the Theory of Arrays. FMCAD Miquel Bofill, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio
2008	A*	`conf`	The Barcelogic SMT Solver. CAV Miquel Bofill, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio
2004	A	`conf`	Redundancy Notions for Paramodulation with Non-monotonic Orderings. IJCAR Miquel Bofill, Albert Rubio
2003	J	`jnl`	Paramodulation and Knuth-Bendix Completion with Nontotal and Nonmonotonic Orderings. J. Autom. Reason. Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio
2002	A	`conf`	Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation. CADE Miquel Bofill, Albert Rubio
2001	A*	`conf`	On the Completeness of Arbitrary Selection Strategies for Paramodulation. ICALP Miquel Bofill, Guillem Godoy
2000	—	`conf`	Modular Redundancy for Theorem Proving. FroCoS Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio
1999	A*	`conf`	Paramodulation with Non-Monotonic Orderings. LICS Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio