The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Albert Rubio: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  36. Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic. [Citation Graph (, )][DBLP]


  37. The Barcelogic SMT Solver. [Citation Graph (, )][DBLP]


  38. The Computability Path Ordering: The End of a Quest. [Citation Graph (, )][DBLP]


  39. A Write-Based Solver for SAT Modulo the Theory of Arrays. [Citation Graph (, )][DBLP]


  40. The computability path ordering: the end of a quest [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.304secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002