Confluence of Non-Left-Linear TRSs via Relative Termination

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-28717-6_21
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Termination of Isabelle Functions via Termination of Rewriting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Termination and Non-Termination Specification Inference

ACM SIGPLAN Notices
Computer Science
2015English

On Termination of Integer Linear Loops

2014English

Linear Combination of Forecasts With Numerical Adjustment via MINIMAX Non-Linear Programming

Revista Gestão da Produção Operações e Sistemas
2016English

Reducing Relative Termination to Dependency Pair Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Proving Non-Termination Using Max-SMT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

BASIC PROPERTIES OF LINEAR RELATIVE N-Widths

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy