PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Bofill, Miquel"

Author of the publication

copydeleteadd this publication to your clipboard
A Write-Based Solver for SAT Modulo the Theory of Arrays.

, , , , and . FMCAD, page 1-8. IEEE, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Bofill, Miquel
add a person with the name Bofill, Miquel
 

Other publications of authors with the same name

Paramodulation with Well-founded Orderings., and . J. Log. Comput., 19 (2): 263-302 (2009)The recursive path and polynomial ordering for first-order and higher-order terms., , , and . J. Log. Comput., 23 (1): 263-305 (2013)The Barcelogic SMT Solver., , , , and . CAV, volume 5123 of Lecture Notes in Computer Science, page 294-298. Springer, (2008)Fuzzy XPath for the Automatic Search of Fuzzy Formulae Models., , , , , and . SUM, volume 9310 of Lecture Notes in Computer Science, page 385-398. Springer, (2015)Reformulation Based MaxSAT Robustness - (Extended Abstract)., , and . CP, volume 8656 of Lecture Notes in Computer Science, page 908-912. Springer, (2014)Solving Intensional Weighted CSPs by Incremental Optimization with BDDs., , , and . CP, volume 8656 of Lecture Notes in Computer Science, page 207-223. Springer, (2014)Resource Analysis driven by (Conditional) Termination Proofs., , , , and . TPLP, 19 (5-6): 722-739 (2019)A System for Generation and Visualization of Resource-Constrained Projects., , , and . CCIA, volume 269 of Frontiers in Artificial Intelligence and Applications, page 237-246. IOS Press, (2014)Paramodulation with Non-Monotonic Orderings., , , and . LICS, page 225-233. IEEE Computer Society, (1999)Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers., , , and . ISMVL, page 25-30. IEEE Computer Society, (2012)