default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiquel Bofill
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c32]Miquel Bofill
, Jordi Coll, Marc Garcia, Jesús Giráldez-Cru, Gilles Pesant, Josep Suy, Mateu Villaret:
Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem (Extended Abstract). IJCAI 2023: 6851-6852- [c31]Miquel Bofill, Jordi Coll, Peter Nightingale, Josep Suy, Felix Ulrich-Oltean, Mateu Villaret:
SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints (Extended Abstract). IJCAI 2023: 6853-6857 - [i5]Miquel Bofill, Cristina Borralleras, Joan Espasa, Mateu Villaret:
On Grid Graph Reachability and Puzzle Games. CoRR abs/2310.01378 (2023) - [i4]Miquel Bofill, Cristina Borralleras, Joan Espasa, Gerard Martín, Gustavo Patow, Mateu Villaret:
A Good Snowman is Hard to Plan. CoRR abs/2310.01471 (2023) - 2022
- [j19]Miquel Bofill, Jordi Coll, Peter Nightingale, Josep Suy, Felix Ulrich-Oltean, Mateu Villaret:
SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints. Artif. Intell. 302: 103604 (2022) - [j18]Miquel Bofill, Jordi Coll, Gerard Martín, Josep Suy, Mateu Villaret:
The Sample Analysis Machine Scheduling Problem: Definition and comparison of exact solving approaches. Comput. Oper. Res. 142: 105730 (2022) - [j17]Miquel Bofill, Jordi Coll, Jesús Giráldez-Cru, Josep Suy, Mateu Villaret:
The Impact of Implied Constraints on MaxSAT B2B Instances. Int. J. Comput. Intell. Syst. 15(1): 63 (2022) - [j16]Miquel Bofill, Jordi Coll, Marc Garcia, Jesús Giráldez-Cru, Gilles Pesant, Josep Suy, Mateu Villaret:
Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem. J. Artif. Intell. Res. 74: 263-301 (2022) - 2021
- [j15]Miquel Bofill, Joan Espasa, Mateu Villaret:
Relaxing non-interference requirements in parallel plans. Log. J. IGPL 29(1): 45-71 (2021) - [i3]Miquel Bofill, Jordi Coll, Peter Nightingale, Josep Suy, Felix Ulrich-Oltean, Mateu Villaret:
SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints. CoRR abs/2110.08068 (2021) - 2020
- [j14]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations. Artif. Intell. Rev. 53(7): 5157-5188 (2020) - [j13]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
SMT encodings for Resource-Constrained Project Scheduling Problems. Comput. Ind. Eng. 149: 106777 (2020)
2010 – 2019
- 2019
- [j12]Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret:
New complexity results for Łukasiewicz logic. Soft Comput. 23(7): 2187-2197 (2019) - [j11]Elvira Albert, Miquel Bofill, Cristina Borralleras, Enrique Martin-Martin, Albert Rubio:
Resource Analysis driven by (Conditional) Termination Proofs. Theory Pract. Log. Program. 19(5-6): 722-739 (2019) - [c30]Miquel Bofill, Jesús Giráldez-Cru, Josep Suy, Mateu Villaret:
A Study on Implied Constraints in a MaxSAT Approach to B2B Problems. CCIA 2019: 183-192 - [c29]Carlos Ansótegui, Miquel Bofill, Jordi Coll, Nguyen Dang, Juan Luis Esteban, Ian Miguel, Peter Nightingale, András Z. Salamon, Josep Suy, Mateu Villaret:
Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. CP 2019: 20-36 - [c28]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations. CPAIOR 2019: 112-128 - [i2]Elvira Albert, Miquel Bofill, Cristina Borralleras, Enrique Martin-Martin, Albert Rubio:
Resource Analysis driven by (Conditional) Termination Proofs. CoRR abs/1907.10096 (2019) - 2017
- [c27]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:
The Spanish Kidney Exchange Model: Study of Computation-Based Alternatives to the Current Procedure. AIME 2017: 272-277 - [c26]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
An Efficient SMT Approach to Solve MRCPSP/max Instances with Tight Constraints on Resources. CP 2017: 71-79 - [c25]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems. IJCAI 2017: 555-562 - [c24]Miquel Bofill, Joan Espasa, Mateu Villaret:
Relaxed Exists-Step Plans in Planning as SMT. IJCAI 2017: 563-570 - 2016
- [j10]Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret:
Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers. Fuzzy Sets Syst. 292: 32-48 (2016) - [j9]Miquel Bofill, Joan Espasa, Mateu Villaret:
The RANTANPLAN planner: system description. Knowl. Eng. Rev. 31(5): 452-464 (2016) - [c23]Miquel Bofill, Joan Espasa, Mateu Villaret:
A Semantic Notion of Interference for Planning Modulo Theories. ICAPS 2016: 56-64 - [c22]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with SMT. ICTAI 2016: 239-246 - [i1]Miquel Bofill, Víctor Muñoz, Javier Murillo:
Solving the Wastewater Treatment Plant Problem with SMT. CoRR abs/1609.05367 (2016) - 2015
- [j8]Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret:
SAT and SMT Technology for Many-Valued Logics. J. Multiple Valued Log. Soft Comput. 24(1-4): 151-172 (2015) - [c21]Miquel Bofill, Marc Garcia, Josep Suy, Mateu Villaret:
MaxSAT-Based Scheduling of B2B Meetings. CPAIOR 2015: 65-73 - [c20]Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret:
Finding Hard Instances of Satisfiability in Lukasiewicz Logics. ISMVL 2015: 30-35 - [c19]Miquel Bofill, Felip Manyà, Amanda Vidal, Mateu Villaret:
The Complexity of 3-Valued Łukasiewicz Rules. MDAI 2015: 221-229 - [c18]Jesús Manuel Almendros-Jiménez, Miquel Bofill, Alejandro Luna Tedesqui, Ginés Moreno, Carlos Vázquez, Mateu Villaret:
Fuzzy XPath for the Automatic Search of Fuzzy Formulae Models. SUM 2015: 385-398 - 2014
- [c17]Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret:
A System for Generation and Visualization of Resource-Constrained Projects. CCIA 2014: 237-246 - [c16]Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret:
Solving Intensional Weighted CSPs by Incremental Optimization with BDDs. CP 2014: 207-223 - [c15]Miquel Bofill, Joan Espasa, Marc Garcia, Miquel Palahí, Josep Suy, Mateu Villaret:
Scheduling B2B Meetings. CP 2014: 781-796 - [c14]Miquel Bofill, Dídac Busquets, Mateu Villaret:
Reformulation Based MaxSAT Robustness - (Extended Abstract). CP 2014: 908-912 - 2013
- [j7]Miquel Bofill, Dídac Busquets, Víctor Muñoz, Mateu Villaret:
Reformulation based MaxSAT robustness. Constraints An Int. J. 18(2): 202-235 (2013) - [j6]Carlos Ansótegui, Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret:
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories. Constraints An Int. J. 18(2): 236-268 (2013) - [j5]Miquel Bofill, Albert Rubio:
Paramodulation with Non-Monotonic Orderings and Simplification. J. Autom. Reason. 50(1): 51-98 (2013) - [j4]Miquel Bofill, Cristina Borralleras, Enric Rodríguez-Carbonell, Albert Rubio:
The recursive path and polynomial ordering for first-order and higher-order terms. J. Log. Comput. 23(1): 263-305 (2013) - 2012
- [j3]Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret:
Solving constraint satisfaction problems with SAT modulo theories. Constraints An Int. J. 17(3): 273-303 (2012) - [c13]Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret:
Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers. ISMVL 2012: 25-30 - 2011
- [c12]Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret:
Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic. ISMVL 2011: 230-235 - [c11]Carlos Ansótegui, Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret:
Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem. SARA 2011 - 2010
- [c10]Miquel Bofill, Dídac Busquets, Mateu Villaret:
A declarative approach to robust weighted Max-SAT. PPDP 2010: 67-76 - [c9]Miquel Bofill, Josep Suy, Mateu Villaret:
A System for Solving Constraint Satisfaction Problems with SMT. SAT 2010: 300-305
2000 – 2009
- 2009
- [j2]Miquel Bofill, Albert Rubio:
Paramodulation with Well-founded Orderings. J. Log. Comput. 19(2): 263-302 (2009) - [c8]Miquel Bofill, Dídac Busquets, Mateu Villaret:
Auction Robustness through Satisability Modulo Theories. WAT 2009: 33-44 - 2008
- [c7]Miquel Bofill, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio:
The Barcelogic SMT Solver. CAV 2008: 294-298 - [c6]Miquel Bofill, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio:
A Write-Based Solver for SAT Modulo the Theory of Arrays. FMCAD 2008: 1-8 - 2004
- [c5]Miquel Bofill, Albert Rubio:
Redundancy Notions for Paramodulation with Non-monotonic Orderings. IJCAR 2004: 107-121 - 2003
- [j1]Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio:
Paramodulation and Knuth-Bendix Completion with Nontotal and Nonmonotonic Orderings. J. Autom. Reason. 30(1): 99-120 (2003) - 2002
- [c4]Miquel Bofill, Albert Rubio:
Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation. CADE 2002: 456-470 - 2001
- [c3]Miquel Bofill, Guillem Godoy:
On the Completeness of Arbitrary Selection Strategies for Paramodulation. ICALP 2001: 951-962 - 2000
- [c2]Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio:
Modular Redundancy for Theorem Proving. FroCoS 2000: 186-199
1990 – 1999
- 1999
- [c1]Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio:
Paramodulation with Non-Monotonic Orderings. LICS 1999: 225-233
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
