Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Miquel Bofill
2010 – today
- 2013
[j7]Miquel Bofill, Dídac Busquets, Víctor Muñoz, Mateu Villaret: Reformulation based MaxSAT robustness. Constraints 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 18(2): 236-268 (2013)
- [j5]Miquel Bofill, Albert Rubio: Paramodulation with Non-Monotonic Orderings and Simplification. J. Autom. Reasoning 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 17(3): 273-303 (2012)
- [c12]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
- [c11]Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret: Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic. ISMVL 2011: 230-235
- [c10]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
- [c9]Miquel Bofill, Dídac Busquets, Mateu Villaret: A declarative approach to robust weighted Max-SAT. PPDP 2010: 67-76
- [c8]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)
- 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. Reasoning 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-03-08 22:08 CET by the dblp team