Kamu erişimi zorunlu olan makaleler - Aart MiddeldorpDaha fazla bilgi edinin
Hiçbir yerde sunulmuyor: 1
Increasing interpretations
H Zankl, A Middeldorp
Annals of Mathematics and Artificial Intelligence 56 (1), 87-108, 2009
Zorunlu olanlar: Austrian Science Fund
Bir yerde sunuluyor: 60
Tyrolean termination tool 2
M Korp, C Sternagel, H Zankl, A Middeldorp
Rewriting Techniques and Applications: 20th International Conference, RTA …, 2009
Zorunlu olanlar: Austrian Science Fund
SAT solving for termination analysis with polynomial interpretations
C Fuhs, J Giesl, A Middeldorp, P Schneider-Kamp, R Thiemann, H Zankl
Theory and Applications of Satisfiability Testing–SAT 2007: 10th …, 2007
Zorunlu olanlar: German Research Foundation
Satisfiability of non-linear (ir) rational arithmetic
H Zankl, A Middeldorp
Logic for Programming, Artificial Intelligence, and Reasoning: 16th …, 2010
Zorunlu olanlar: Austrian Science Fund
CSI–A confluence tool
H Zankl, B Felgenhauer, A Middeldorp
Automated Deduction–CADE-23: 23rd International Conference on Automated …, 2011
Zorunlu olanlar: Austrian Science Fund
Maximal termination
C Fuhs, J Giesl, A Middeldorp, P Schneider-Kamp, R Thiemann, H Zankl
Rewriting Techniques and Applications: 19th International Conference, RTA …, 2008
Zorunlu olanlar: Austrian Science Fund, German Research Foundation
Conditional confluence (system description)
T Sternagel, A Middeldorp
Rewriting and Typed Lambda Calculi: Joint International Conference, RTA-TLCA …, 2014
Zorunlu olanlar: Austrian Science Fund
CSI: New evidence–a progress report
J Nagele, B Felgenhauer, A Middeldorp
International Conference on Automated Deduction, 385-397, 2017
Zorunlu olanlar: Austrian Science Fund
Decreasing diagrams and relative termination
N Hirokawa, A Middeldorp
Journal of Automated Reasoning 47 (4), 481-501, 2011
Zorunlu olanlar: Austrian Science Fund
Labelings for decreasing diagrams
H Zankl, B Felgenhauer, A Middeldorp
Journal of Automated Reasoning 54 (2), 101-133, 2015
Zorunlu olanlar: Austrian Science Fund
Root-labeling
C Sternagel, A Middeldorp
Rewriting Techniques and Applications: 19th International Conference, RTA …, 2008
Zorunlu olanlar: Austrian Science Fund
KBO orientability
H Zankl, N Hirokawa, A Middeldorp
Journal of Automated Reasoning 43 (2), 173-201, 2009
Zorunlu olanlar: Austrian Science Fund
Uncurrying for termination
N Hirokawa, A Middeldorp, H Zankl
International Conference on Logic for Programming Artificial Intelligence …, 2008
Zorunlu olanlar: Austrian Science Fund
Revisiting matrix interpretations for polynomial derivational complexity of term rewriting
F Neurauter, H Zankl, A Middeldorp
Logic for Programming, Artificial Intelligence, and Reasoning: 17th …, 2010
Zorunlu olanlar: Austrian Science Fund
Joint spectral radius theory for automated complexity analysis of rewrite systems
A Middeldorp, G Moser, F Neurauter, J Waldmann, H Zankl
Algebraic Informatics: 4th International Conference, CAI 2011, Linz, Austria …, 2011
Zorunlu olanlar: Austrian Science Fund
Finding and certifying loops
H Zankl, C Sternagel, D Hofbauer, A Middeldorp
International Conference on Current Trends in Theory and Practice of …, 2010
Zorunlu olanlar: Austrian Science Fund
Automating the first-order theory of rewriting for left-linear right-ground rewrite systems
F Rapp, A Middeldorp
1st International Conference on Formal Structures for Computation and …, 2016
Zorunlu olanlar: Austrian Science Fund
Completion for logically constrained rewriting
S Winkler, A Middeldorp
3rd International Conference on Formal Structures for Computation and …, 2018
Zorunlu olanlar: Austrian Science Fund
Improving automatic confluence analysis of rewrite systems by redundant rules
J Nagele, B Felgenhauer, A Middeldorp
26th International Conference on Rewriting Techniques and Applications (RTA …, 2015
Zorunlu olanlar: Austrian Science Fund
Uncurrying for termination and complexity
N Hirokawa, A Middeldorp, H Zankl
Journal of Automated Reasoning 50 (3), 279-315, 2013
Zorunlu olanlar: Austrian Science Fund
Yayıncılık ve maddi kaynak bilgileri otomatik olarak bir bilgisayar programı tarafından belirlenmektedir