Travelled to:1 × Denmark
1 × Germany
1 × Hungary
1 × Ireland
1 × Japan
1 × Spain
1 × United Kingdom
2 × Austria
2 × Canada
3 × France
4 × Italy
6 × USA
Collaborated with:R.Nieuwenhuis J.Jouannaud M.Bofill E.Rodríguez-Carbonell C.Borralleras ∅ A.Oliveras D.Larraz G.Godoy S.Lucas M.Fernández F.Blanqui M.Fernández M.Ferreira H.Comon F.Orejas E.Albert M.Gómez-Zamalloa M.Isabel J.Giesl F.Mesnard R.Thiemann J.Waldmann K.Nimkar R.Navarro-Marset
Talks about:order (19) path (6) monoton (4) complet (4) non (4) constraint (3) paramodul (3) termin (3) rewrit (3) recurs (3)
Person: Albert Rubio
DBLP: Rubio:Albert
Contributed to:
2015
2014
2014
2013
201220092008
2008
200720062005
2004200320022000
19991999199619951995199419931992
199219902018Wrote 28 papers:
- CADE-2015-GieslMRTW #contest #termination
- Termination Competition (termCOMP 2015) (JG, FM, AR, RT, JW), pp. 105–108.
- CAV-2014-LarrazNORR #proving #using
- Proving Non-termination Using Max-SMT (DL, KN, AO, ERC, AR), pp. 779–796.
- SAT-2014-LarrazORR #constraints #polynomial
- Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions (DL, AO, ERC, AR), pp. 333–350.
- VMCAI-2013-LarrazRR #array #generative #invariant #smt
- SMT-Based Array Invariant Generation (DL, ERC, AR), pp. 169–188.
- ICALP-v2-2012-FernandezR #term rewriting
- Nominal Completion for Rewrite Systems with Binders (MF, AR), pp. 201–213.
- CADE-2009-BorrallerasLNRR #linear #polynomial #satisfiability
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (CB, SL, RNM, ERC, AR), pp. 294–305.
- CAV-2008-BofillNORR #smt
- The Barcelogic SMT Solver (MB, RN, AO, ERC, AR), pp. 294–298.
- CSL-2008-BlanquiJR #order
- The Computability Path Ordering: The End of a Quest (FB, JPJ, AR), pp. 1–14.
- RTA-2007-NieuwenhuisORR #challenge #modulo theories #satisfiability
- Challenges in Satisfiability Modulo Theories (RN, AO, ERC, AR), pp. 2–18.
- RTA-2006-JouannaudR #higher-order
- Higher-Order Orderings for Normal Rewriting (JPJ, AR), pp. 387–399.
- RTA-2005-FernandezGR #order #termination
- Orderings for Innermost Termination (MLF, GG, AR), pp. 17–31.
- IJCAR-2004-BofillR #order
- Redundancy Notions for Paramodulation with Non-monotonic Orderings (MB, AR), pp. 107–121.
- RTA-2003-BorrallerasR #order #semantics
- Monotonic AC-Compatible Semantic Path Orderings (CB, AR), pp. 279–295.
- CADE-2002-BofillR #order
- Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation (MB, AR), pp. 456–470.
- CADE-2002-BorrallerasLR #order #recursion
- Recursive Path Orderings Can Be Context-Sensitive (CB, SL, AR), pp. 314–331.
- CADE-2000-BorrallerasFR #order #semantics
- Complete Monotonic Semantic Path Orderings (CB, MF, AR), pp. 346–364.
- LICS-1999-BofillGNR #order
- Paramodulation with Non-Monotonic Orderings (MB, GG, RN, AR), pp. 225–233.
- LICS-1999-JouannaudR #higher-order #recursion
- The Higher-Order Recursive Path Ordering (JPJ, AR), pp. 402–411.
- RTA-1999-Rubio
- A Fully Syntactic AC-RPO (AR), pp. 133–147.
- RTA-1996-JouannaudR #higher-order #normalisation #recursion
- A Recursive Path Ordering for Higher-Order Terms in η-Long β-Normal Form (JPJ, AR), pp. 108–122.
- ICALP-1995-Rubio #order
- Extension Orderings (AR), pp. 511–522.
- LICS-1995-ComonNR #constraints #order #theorem proving
- Orderings, AC-Theories and Symbolic Constraint Solving (HC, RN, AR), pp. 375–385.
- CADE-1994-NieuwenhuisR #constraints
- AC-Superposition with Constraints: No AC-Unifiers Needed (RN, AR), pp. 545–559.
- RTA-1993-RubioN #order
- A Precedence-Based Total AC-Compatible Ordering (AR, RN), pp. 374–388.
- CADE-1992-NieuwenhuisR #proving #theorem proving
- Theorem Proving with Ordering Constrained Clauses (RN, AR), pp. 477–491.
- ESOP-1992-NieuwenhuisR
- Basic Superposition is Complete (RN, AR), pp. 371–389.
- CADE-1990-NieuwenhuisOR #implementation #named
- TRIP: An Implementation of Clausal Rewriting (RN, FO, AR), pp. 667–668.
- CAV-2018-AlbertGIR #partial order #reduction
- Constrained Dynamic Partial Order Reduction (EA, MGZ, MI, AR), pp. 392–410.