Seguir
Robert Nieuwenhuis
Robert Nieuwenhuis
Professor of Computer Science, Tech. Univ. Catalonia (UPC), Barcelona
Dirección de correo verificada de cs.upc.edu - Página principal
Título
Citado por
Citado por
Año
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)
R Nieuwenhuis, A Oliveras, C Tinelli
Journal of the ACM (JACM) 53 (6), 937-977, 2006
10912006
Paramodulation-Based Theorem Proving, chapter Handbook of Automated Reasoning, Volume I, Chapter 7
R Nieuwenhuis, A Rubio
Elsevier Science and MIT Press, 2001
489*2001
DPLL(T): Fast Decision Procedures
H Ganzinger, G Hagen, R Nieuwenhuis, A Oliveras, C Tinelli
International Conference on Computer Aided Verification, 175-188, 2004
4312004
On SAT modulo theories and optimization problems
R Nieuwenhuis, A Oliveras
International conference on theory and applications of satisfiability …, 2006
1822006
Cardinality networks: a theoretical and empirical study
R Asín, R Nieuwenhuis, A Oliveras, E Rodríguez-Carbonell
Constraints 16 (2), 195-221, 2011
1722011
DPLL (T) with exhaustive theory propagation and its application to difference logic
R Nieuwenhuis, A Oliveras
International Conference on Computer Aided Verification, 321-334, 2005
1692005
Theorem proving with ordering and equality constrained clauses
R Nieuwenhuis, A Rubio
Journal of Symbolic Computation 19 (4), 321-351, 1995
1611995
SMT techniques for fast predicate abstraction
SK Lahiri, R Nieuwenhuis, A Oliveras
International Conference on Computer Aided Verification, 424-437, 2006
1412006
Abstract DPLL and abstract DPLL modulo theories
R Nieuwenhuis, A Oliveras, C Tinelli
International Conference on Logic for Programming Artificial Intelligence …, 2005
1412005
The barcelogic SMT solver
M Bofill, R Nieuwenhuis, A Oliveras, E Rodríguez-Carbonell, A Rubio
International Conference on Computer Aided Verification, 294-298, 2008
1282008
Splitting on demand in SAT modulo theories
C Barrett, R Nieuwenhuis, A Oliveras, C Tinelli
International Conference on Logic for Programming Artificial Intelligence …, 2006
1262006
Proof-producing congruence closure
R Nieuwenhuis, A Oliveras
International Conference on Rewriting Techniques and Applications, 453-468, 2005
1192005
Curriculum-based course timetabling with SAT and MaxSAT
R Asín Achá, R Nieuwenhuis
Annals of Operations Research 218 (1), 71-91, 2014
1112014
Basic superposition is complete
R Nieuwenhuis, A Rubio
European Symposium on Programming, 371-389, 1992
1101992
Theorem proving with ordering constrained clauses
R Nieuwenhuis, A Rubio
International Conference on Automated Deduction, 477-491, 1992
1021992
Fast congruence closure and extensions
R Nieuwenhuis, A Oliveras
Information and Computation 205 (4), 557-580, 2007
982007
Cardinality networks and their applications
R Asín, R Nieuwenhuis, A Oliveras, E Rodríguez-Carbonell
International Conference on Theory and Applications of Satisfiability …, 2009
892009
A new look at BDDs for pseudo-Boolean constraints
I Abío, R Nieuwenhuis, A Oliveras, E Rodríguez-Carbonell, ...
Journal of Artificial Intelligence Research 45, 443-480, 2012
862012
Simple LPO constraint solving methods
R Nieuwenhuis
Information Processing Letters 47 (2), 65-69, 1993
841993
Induction= I-axiomatization+ first-order consistency
H Comon, R Nieuwenhuis
Information and Computation 159 (1-2), 151-186, 2000
732000
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20