|
|
Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers |
Ansótegui, Carlos
; Bofill Arasa, Miquel
; Manyà , Felip
; Villaret i Ausellé, Mateu
|
|
1 juny 2016 |
Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers |
Ansótegui, Carlos
; Bofill Arasa, Miquel
; Manyà , Felip
; Villaret i Ausellé, Mateu
|
|
|
Fuzzy XPath for the automatic search of fuzzy formulae models |
Almendros-Jimenez, Jesùs M.
; Bofill Arasa, Miquel
; Luna-Tedesqui, Alejandro
; Moreno, Ginès
; VÃ zquez, Carlos
; Villaret i Ausellé, Mateu
|
|
1 gener 2015 |
Fuzzy XPath for the automatic search of fuzzy formulae models |
Almendros-Jiménez, Jesús M.
; Bofill Arasa, Miquel
; Luna-Tedesqui, Alejandro
; Moreno, Ginès
; VÃ zquez, Carlos
; Villaret i Ausellé, Mateu
|
|
5 juny 2018 |
The RANTANPLAN planner: system description |
Bofill Arasa, Miquel
; Espasa, Joan
; Villaret i Ausellé, Mateu
|
|
22 desembre 2016 |
The RANTANPLAN planner: system description |
Bofill Arasa, Miquel
; Espasa Arxer, Joan
; Villaret i Ausellé, Mateu
|
|
|
Reformulation of constraint models into SMT |
Palahà i Sitges, Miquel
|
|
|
Resource Analysis driven by (Conditional) Termination Proofs |
Albert, Elvira
; Bofill Arasa, Miquel
; Borralleras, Cristina
; MartÃn-MartÃn, Enrique
; Rubio, Albert
|
|
gener 2022 |
SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints |
Bofill Arasa, Miquel
; Coll Caballero, Jordi
; Nightingale, Peter
; Suy Franch, Josep
; Ulrich-Oltean, Felix
; Villaret i Ausellé, Mateu
|
|
20 desembre 2012 |
A satisfiability modulo theories approach to constraint programming |
Suy Franch, Josep
|
|
|
A satisfiability modulo theories approach to constraint programming |
Suy Franch, Josep
|
|
2009 |
SIMPLY: a Compiler from a CSP Modeling Language to the SMT-LIB Format |
Bofill Arasa, Miquel
; Palahà i Sitges, Miquel
; Suy Franch, Josep
; Villaret i Ausellé, Mateu
|
|
|
SIMPLY: a Compiler from a CSP Modeling Language to the SMT-LIB Format |
Bofill Arasa, Miquel
; Palahà i Sitges, Miquel
; Suy Franch, Josep
; Villaret i Ausellé, Mateu
|
|
|
SIMPLY: a Compiler from a CSP Modeling Language to the SMT-LIB Format |
Bofill Arasa, Miquel
; Palahà i Sitges, Miquel
; Suy Franch, Josep
; Villaret i Ausellé, Mateu
|
|
15 novembre 2018 |
SMT techniques for planning problems |
Espasa Arxer, Joan
|
|
|
Solving constraint satisfaction problems with SAT modulo theories |
Bofill Arasa, Miquel
; Palahà i Sitges, Miquel
; Suy Franch, Josep
; Villaret i Ausellé, Mateu
|
|
2012 |
Solving constraint satisfaction problems with SAT modulo theories |
Bofill Arasa, Miquel
; Palahà i Sitges, Miquel
; Suy Franch, Josep
; Villaret i Ausellé, Mateu
|
|
|
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories |
Ansótegui, Carlos
; Bofill Arasa, Miquel
; Palahà i Sitges, Miquel
; Suy Franch, Josep
; Villaret i Ausellé, Mateu
|
|
1 gener 2013 |
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories |
Ansótegui, Carlos
; Bofill Arasa, Miquel
; Palahà i Sitges, Miquel
; Suy Franch, Josep
; Villaret i Ausellé, Mateu
|
|
|
A Write-Based Solver for SAT Modulo the Theory of Arrays |
Bofill Arasa, Miquel
; Nieuwenhuis, Robert
; Oliveras Llunell, Albert
; RodrÃguez Carbonell, Enric
; Rubio, Albert
|
|
2008 |
A Write-Based Solver for SAT Modulo the Theory of Arrays |
Bofill Arasa, Miquel
; Nieuwenhuis, Robert
; Oliveras Llunell, Albert
; RodrÃguez Carbonell, Enric
; Rubio, Albert
|