Publicaciones en colaboración con investigadores/as de Universitat de Vic (10)

2019

  1. Incomplete smt techniques for solving non-linear formulas over the integers

    ACM Transactions on Computational Logic, Vol. 20, Núm. 4

  2. Resource Analysis driven by (Conditional) Termination Proofs

    Theory and Practice of Logic Programming, Vol. 19, Núm. 5-6, pp. 722-739

2017

  1. Proving termination through conditional termination

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

2012

  1. SAT modulo linear arithmetic for solving polynomial constraints

    Journal of Automated Reasoning, Vol. 48, Núm. 1, pp. 107-131

2009

  1. Solving non-linear polynomial arithmetic via SAT modulo linear arithmetic

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

2007

  1. Orderings and constraints: Theory and practice of proving termination

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

2003

  1. Monotonic AC-compatible semantic path orderings

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

2002

  1. Recursive path orderings can be context-sensitive

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

2001

  1. A monotonic higher-order semantic path ordering

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

2000

  1. Complete monotonic semantic path orderings

    Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)