( en | de | ru )

 

Disambiguation of "Oliveras, Albert"

Author of the publication

copydeleteadd this publication to your clipboard
MiniMaxSat: A New Weighted Max-SAT Solver.

, , and . SAT, volume 4501 of Lecture Notes in Computer Science, page 41-55. Springer, (2007)

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.

Albert Moser

Carsten Albert

Albert Waal

Albert Moser

Rudolf Albert

 

Other publications of authors with the same name

Employee Scheduling With SAT-Based Pseudo-Boolean Constraint Solving., , , and . IEEE Access, (2021)Cardinality Networks: a theoretical and empirical study., , , and . Constraints An Int. J., 16 (2): 195-221 (2011)Analyzing Multiple Conflicts in SAT: An Experimental Evaluation., , and . LPAR, volume 94 of EPiC Series in Computing, page 306-316. EasyChair, (2023)6 Years of SMT-COMP., , , , and . J. Autom. Reason., 50 (3): 243-277 (2013)A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints., , , and . CP, volume 8124 of Lecture Notes in Computer Science, page 80-96. Springer, (2013)IntSat: Integer Linear Programming by Conflict-Driven Constraint-Learning., , and . CoRR, (2024)Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)., , and . J. ACM, 53 (6): 937-977 (2006)Splitting on Demand in SAT Modulo Theories., , , and . LPAR, volume 4246 of Lecture Notes in Computer Science, page 512-526. Springer, (2006)Congruence Closure with Integer Offsets., and . LPAR, volume 2850 of Lecture Notes in Computer Science, page 78-90. Springer, (2003)Proof-Producing Congruence Closure., and . RTA, volume 3467 of Lecture Notes in Computer Science, page 453-468. Springer, (2005)