2021
DOI: 10.1007/978-3-030-88701-8_19
|View full text |Cite
|
Sign up to set email alerts
|

Time Warps, from Algebra to Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…That is, an algorithm is required that decides equations between terms interpreted over the algebraic structure of time warps. In a precursor to this paper [25], decidability of the equational theory of the bounded residuated lattice W, ∧, ∨, •, \, /, id, ⊥, ⊤ , with least and greatest time warps ⊥ and ⊤, respectively, was established. A key ingredient of the proof, however, involves translating terms into a rather awkward normal form which both complicates the decision procedure and obscures the algebraic meaning of the equations.…”
Section: Introductionmentioning
confidence: 99%
“…That is, an algorithm is required that decides equations between terms interpreted over the algebraic structure of time warps. In a precursor to this paper [25], decidability of the equational theory of the bounded residuated lattice W, ∧, ∨, •, \, /, id, ⊥, ⊤ , with least and greatest time warps ⊥ and ⊤, respectively, was established. A key ingredient of the proof, however, involves translating terms into a rather awkward normal form which both complicates the decision procedure and obscures the algebraic meaning of the equations.…”
Section: Introductionmentioning
confidence: 99%