( en | de | ru )

 

Disambiguation of "Oliveras, Albert"

Author of the publication

copydeleteadd this publication to your clipboard
Proof-Producing Congruence Closure.

, and . RTA, volume 3467 of Lecture Notes in Computer Science, page 453-468. Springer, (2005)

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 Kellershohn

Albert Müller

Albert Stork

Albert Herlan

Albert Koep

 

Other publications of authors with the same name

Analyzing Multiple Conflicts in SAT: An Experimental Evaluation., , and . LPAR, volume 94 of EPiC Series in Computing, page 306-316. EasyChair, (2023)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)Preface., and . SMT@CAV, volume 198 of Electronic Notes in Theoretical Computer Science, page 1-2. Elsevier, (2007)Abstract DPLL and Abstract DPLL Modulo Theories., , and . LPAR, volume 3452 of Lecture Notes in Computer Science, page 36-50. Springer, (2004)DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic., and . CAV, volume 3576 of Lecture Notes in Computer Science, page 321-334. Springer, (2005)The Barcelogic SMT Solver., , , , and . CAV, volume 5123 of Lecture Notes in Computer Science, page 294-298. Springer, (2008)Two level continuous speech recognition using demisyllable-based HMM word spotting., , , and . EUROSPEECH, page 1199-1202. ISCA, (1991)Proving Termination Through Conditional Termination., , , , , and . TACAS (1), volume 10205 of Lecture Notes in Computer Science, page 99-117. (2017)Decision levels are stable: towards better SAT heuristics., , , and . LPAR, volume 73 of EPiC Series in Computing, page 1-11. EasyChair, (2020)MiniMaxSat: A New Weighted Max-SAT Solver., , and . SAT, volume 4501 of Lecture Notes in Computer Science, page 41-55. Springer, (2007)