Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Domènec Farré
Lawrence Jarvis
Dalila Hamami
Kai Wang
Erik Sundén
Giovina Marina La Vecchia
Gergely Biczók
Viktor Kessler
Shah, Vipul
Timo Bänziger
Home
/
Author
/
ALBERT RUBIO
Author Info
Open Visualization
Name
Affiliation
Papers
ALBERT RUBIO
UNIV POLITECN CATALUNYA, PAU GARGALLO 5, E-08028 BARCELONA, SPAIN
20
Collaborators
Citations
PageRank
17
228
19.44
Referers
Referees
References
252
256
351
Search Limit
100
256
Publications (20 rows)
Collaborators (17 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
The Termination and Complexity Competition.
0
0.34
2019
Normal Higher-Order Termination
1
0.36
2015
The computability path ordering
9
0.52
2015
Smt-Based Array Invariant Generation
16
0.62
2013
Paramodulation with Non-Monotonic Orderings and Simplification
3
0.41
2013
Nominal completion for rewrite systems with binders
5
0.50
2012
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
21
1.05
2009
Paramodulation with Well-founded Orderings
1
0.36
2009
A write-based solver for SAT modulo the theory of arrays
7
0.54
2008
The Computability Path Ordering: The End of a Quest
19
0.74
2008
HORPO with computability closure: a reconstruction
7
0.47
2007
Recursive path orderings can also be incremental
1
0.39
2005
Orderings for Innermost Termination
4
0.39
2005
Redundancy Notions for Paramodulation with Non-monotonic Orderings
3
0.45
2004
Paramodulation and Knuth–Bendix Completion with Nontotal and Nonmonotonic Orderings
5
0.48
2003
A Fully Syntactic AC-RPO
19
1.12
2002
Paramodulation with built-in AC-theories and symbolic constraints
10
0.61
1997
A total AC-compatible ordering based on RPO
20
0.92
1995
Theorem proving with ordering and equality constrained clauses
73
8.60
1995
Theorem Proving modulo Associativity
4
0.59
1995
1
