| 2008 |
|---|
| 39 | EE | Miquel Bofill,
Robert Nieuwenhuis,
Albert Oliveras,
Enric Rodríguez-Carbonell,
Albert Rubio:
The Barcelogic SMT Solver.
CAV 2008: 294-298 |
| 38 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Albert Rubio:
The Computability Path Ordering: The End of a Quest.
CSL 2008: 1-14 |
| 37 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Albert Rubio:
The computability path ordering: the end of a quest
CoRR abs/0806.2517: (2008) |
| 2007 |
|---|
| 36 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Albert Rubio:
HORPO with Computability Closure: A Reconstruction.
LPAR 2007: 138-150 |
| 35 | EE | Robert Nieuwenhuis,
Albert Oliveras,
Enric Rodríguez-Carbonell,
Albert Rubio:
Challenges in Satisfiability Modulo Theories.
RTA 2007: 2-18 |
| 34 | EE | Cristina Borralleras,
Albert Rubio:
Orderings and Constraints: Theory and Practice of Proving Termination.
Rewriting, Computation and Proof 2007: 28-43 |
| 33 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Albert Rubio:
HORPO with Computability Closure : A Reconstruction
CoRR abs/0708.3582: (2007) |
| 32 | EE | Jean-Pierre Jouannaud,
Albert Rubio:
Polymorphic higher-order recursive path orderings.
J. ACM 54(1): (2007) |
| 2006 |
|---|
| 31 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Albert Rubio:
Higher-Order Termination: From Kruskal to Computability.
LPAR 2006: 1-14 |
| 30 | EE | Jean-Pierre Jouannaud,
Albert Rubio:
Higher-Order Orderings for Normal Rewriting.
RTA 2006: 387-399 |
| 29 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Albert Rubio:
Higher-Order Termination: from Kruskal to Computability
CoRR abs/cs/0609039: (2006) |
| 2005 |
|---|
| 28 | EE | Mirtha-Lina Fernández,
Guillem Godoy,
Albert Rubio:
Recursive Path Orderings Can Also Be Incremental.
LPAR 2005: 230-245 |
| 27 | EE | Mirtha-Lina Fernández,
Guillem Godoy,
Albert Rubio:
Orderings for Innermost Termination.
RTA 2005: 17-31 |
| 2004 |
|---|
| 26 | EE | Miquel Bofill,
Albert Rubio:
Redundancy Notions for Paramodulation with Non-monotonic Orderings.
IJCAR 2004: 107-121 |
| 2003 |
|---|
| 25 | EE | Cristina Borralleras,
Albert Rubio:
Monotonic AC-Compatible Semantic Path Orderings.
RTA 2003: 279-295 |
| 24 | | Miquel Bofill,
Guillem Godoy,
Robert Nieuwenhuis,
Albert Rubio:
Paramodulation and Knuth-Bendix Completion with Nontotal and Nonmonotonic Orderings.
J. Autom. Reasoning 30(1): 99-120 (2003) |
| 2002 |
|---|
| 23 | EE | Cristina Borralleras,
Salvador Lucas,
Albert Rubio:
Recursive Path Orderings Can Be Context-Sensitive.
CADE 2002: 314-331 |
| 22 | EE | Miquel Bofill,
Albert Rubio:
Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation.
CADE 2002: 456-470 |
| 21 | EE | Albert Rubio:
A Fully Syntactic AC-RPO.
Inf. Comput. 178(2): 515-533 (2002) |
| 2001 |
|---|
| 20 | EE | Cristina Borralleras,
Albert Rubio:
A Monotonic Higher-Order Semantic Path Ordering.
LPAR 2001: 531-547 |
| 19 | | Robert Nieuwenhuis,
Albert Rubio:
Paramodulation-Based Theorem Proving.
Handbook of Automated Reasoning 2001: 371-443 |
| 2000 |
|---|
| 18 | | Cristina Borralleras,
Maria Ferreira,
Albert Rubio:
Complete Monotonic Semantic Path Orderings.
CADE 2000: 346-364 |
| 17 | | Miquel Bofill,
Guillem Godoy,
Robert Nieuwenhuis,
Albert Rubio:
Modular Redundancy for Theorem Proving.
FroCos 2000: 186-199 |
| 1999 |
|---|
| 16 | EE | Miquel Bofill,
Guillem Godoy,
Robert Nieuwenhuis,
Albert Rubio:
Paramodulation with Non-Monotonic Orderings.
LICS 1999: 225-233 |
| 15 | EE | Jean-Pierre Jouannaud,
Albert Rubio:
The Higher-Order Recursive Path Ordering.
LICS 1999: 402-411 |
| 14 | EE | Albert Rubio:
A Fully Syntactic AC-RPO.
RTA 1999: 133-147 |
| 1998 |
|---|
| 13 | EE | Jean-Pierre Jouannaud,
Albert Rubio:
Rewrite Orderings for Higher-Order Terms in eta-Long beta-Normal Form and Recursive Path Ordering.
Theor. Comput. Sci. 208(1-2): 33-58 (1998) |
| 1997 |
|---|
| 12 | | Robert Nieuwenhuis,
Albert Rubio:
Paramodulation with Built-in AC-Theories and Symbolic Constraints.
J. Symb. Comput. 23(1): 1-21 (1997) |
| 1996 |
|---|
| 11 | | Jean-Pierre Jouannaud,
Albert Rubio:
A Recursive Path Ordering for Higher-Order Terms in eta-Long beta-Normal Form.
RTA 1996: 108-122 |
| 1995 |
|---|
| 10 | | Albert Rubio:
Theorem Proving modulo Associativity.
CSL 1995: 452-467 |
| 9 | | Albert Rubio:
Extension Orderings.
ICALP 1995: 511-522 |
| 8 | | Hubert Comon,
Robert Nieuwenhuis,
Albert Rubio:
Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract)
LICS 1995: 375-385 |
| 7 | | Robert Nieuwenhuis,
Albert Rubio:
Theorem Proving with Ordering and Equality Constrained Clauses.
J. Symb. Comput. 19(4): 321-351 (1995) |
| 6 | EE | Albert Rubio,
Robert Nieuwenhuis:
A Total AC-Compatible Ordering Based on RPO.
Theor. Comput. Sci. 142(2): 209-227 (1995) |
| 1994 |
|---|
| 5 | | Robert Nieuwenhuis,
Albert Rubio:
AC-Superposition with Constraints: No AC-Unifiers Needed.
CADE 1994: 545-559 |
| 1993 |
|---|
| 4 | | Albert Rubio,
Robert Nieuwenhuis:
A Precedence-Based Total AC-Compatible Ordering.
RTA 1993: 374-388 |
| 1992 |
|---|
| 3 | | Robert Nieuwenhuis,
Albert Rubio:
Theorem Proving with Ordering Constrained Clauses.
CADE 1992: 477-491 |
| 2 | | Robert Nieuwenhuis,
Albert Rubio:
Basic Superposition is Complete.
ESOP 1992: 371-389 |
| 1990 |
|---|
| 1 | | Robert Nieuwenhuis,
Fernando Orejas,
Albert Rubio:
TRIP: An Implementation of Clausal Rewriting.
CADE 1990: 667-668 |
