Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Efficient Generation of Unsatisfiability Proofs and Cores in SAT.

R. Asín, R. Nieuwenhuis, A. Oliveras, and E. Rodríguez-Carbonell. LPAR, volume 5330 of Lecture Notes in Computer Science, page 16-30. Springer, (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.

Univ. -Prof. Dr. Albert Jeltsch University of Stuttgart

Dr. Albert Julius Rostas University of Stuttgart

Hon. -Prof. Dr. Albert Nonnenmacher University of Stuttgart

Albert Emrich University of Stuttgart

apl. Prof. Dr. -Ing. Albert Bursik University of Stuttgart

Other publications of authors with the same name

Cardinality Networks: a theoretical and empirical study.R. Asín, R. Nieuwenhuis, A. Oliveras, and E. Rodríguez-Carbonell. Constraints, 16 (2): 195-221 (2011)6 Years of SMT-COMP.C. Barrett, M. Deters, L. de Moura, A. Oliveras, and A. Stump. J. Autom. Reasoning, 50 (3): 243-277 (2013)A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints.I. Abío, R. Nieuwenhuis, A. Oliveras, and E. Rodríguez-Carbonell. CP, volume 8124 of Lecture Notes in Computer Science, page 80-96. Springer, (2013)Practical algorithms for unsatisfiability proof and core generation in SAT solvers.R. Achá, R. Nieuwenhuis, A. Oliveras, and E. Rodríguez-Carbonell. AI Commun., 23 (2-3): 145-157 (2010)Proving Non-termination Using Max-SMT.D. Larraz, K. Nimkar, A. Oliveras, E. Rodríguez-Carbonell, and A. Rubio. CAV, volume 8559 of Lecture Notes in Computer Science, page 779-796. Springer, (2014)Congruence Closure with Integer Offsets.R. Nieuwenhuis, and A. Oliveras. LPAR, volume 2850 of Lecture Notes in Computer Science, page 78-90. Springer, (2003)Semiring-Induced Propositional Logic: Definition and Basic Algorithms.J. Larrosa, A. Oliveras, and E. Rodríguez-Carbonell. LPAR (Dakar), volume 6355 of Lecture Notes in Computer Science, page 332-347. Springer, (2010)Splitting on Demand in SAT Modulo Theories.C. Barrett, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. LPAR, volume 4246 of Lecture Notes in Computer Science, page 512-526. Springer, (2006)Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers.C. Borralleras, D. Larraz, E. Rodríguez-Carbonell, A. Oliveras, and A. Rubio. ACM Trans. Comput. Log., 20 (4): 25:1-25:36 (2019)Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T).R. Nieuwenhuis, A. Oliveras, and C. Tinelli. J. ACM, 53 (6): 937-977 (2006)