Publicaciones en las que colabora con Robert Nieuwenhuis (14)

2008

  1. 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

  2. The Barcelogic SMT solver: Tool paper

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2007

  1. Challenges in Satisfiability Modulo Theories

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2003

  1. Paramodulation and Knuth-Bendix completion with nontotal and nonmonotonic orderings

    Journal of Automated Reasoning, Vol. 30, Núm. 1, pp. 99-120

2000

  1. Modular redundancy for theorem proving

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

1999

  1. Paramodulation with non-monotonic orderings

    Proceedings - Symposium on Logic in Computer Science

1997

  1. Paramodulation with built-in AC-theories and symbolic constraints

    Journal of Symbolic Computation, Vol. 23, Núm. 1, pp. 1-21

1995

  1. A total AC-compatible ordering based on RPO

    Theoretical Computer Science, Vol. 142, Núm. 2, pp. 209-227

  2. Orderings, AC-theories and symbolic constraint solving

    Proceedings - Symposium on Logic in Computer Science

  3. Theorem proving with ordering and equality constrained clauses

    Journal of Symbolic Computation, Vol. 19, Núm. 4, pp. 321-351

1994

  1. 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

  1. Basic superposition is complete

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. Theorem proving with ordering constrained clauses

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

1990

  1. TRIP: An implementation of clausal rewriting

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)