Robert
Nieuwenhuis
Publikationen, an denen er mitarbeitet Robert Nieuwenhuis (14)
2008
-
A write-based solver F or SAT modulo the theory of arrays
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design, FMCAD
-
The Barcelogic SMT solver: Tool paper
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2007
-
Challenges in Satisfiability Modulo Theories
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2003
-
Paramodulation and Knuth-Bendix completion with nontotal and nonmonotonic orderings
Journal of Automated Reasoning, Vol. 30, Núm. 1, pp. 99-120
2000
-
Modular redundancy for theorem proving
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1999
-
Paramodulation with non-monotonic orderings
Proceedings - Symposium on Logic in Computer Science
1997
-
Paramodulation with built-in AC-theories and symbolic constraints
Journal of Symbolic Computation, Vol. 23, Núm. 1, pp. 1-21
1995
-
A total AC-compatible ordering based on RPO
Theoretical Computer Science, Vol. 142, Núm. 2, pp. 209-227
-
Orderings, AC-theories and symbolic constraint solving
Proceedings - Symposium on Logic in Computer Science
-
Theorem proving with ordering and equality constrained clauses
Journal of Symbolic Computation, Vol. 19, Núm. 4, pp. 321-351
1994
-
Ac-superposition with constraints: No AC-unifiers needed
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1992
-
Basic superposition is complete
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
-
Theorem proving with ordering constrained clauses
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1990
-
TRIP: An implementation of clausal rewriting
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)