1994
DOI: 10.1007/3-540-58216-9_40
|View full text |Cite
|
Sign up to set email alerts
|

On conditional rewrite systems with extra variables and deterministic logic programs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
28
0

Year Published

1995
1995
2017
2017

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 23 publications
(29 citation statements)
references
References 3 publications
1
28
0
Order By: Relevance
“…This property is used in the proof of [4,Theorem 4.2]. By a small change to the definition of unfeasibility we avoid this requirement for our extension to quasi-decreasingness.…”
Section: Definition 2 Consider a Set C Of Equations Between Terms Whmentioning
confidence: 99%
See 4 more Smart Citations
“…This property is used in the proof of [4,Theorem 4.2]. By a small change to the definition of unfeasibility we avoid this requirement for our extension to quasi-decreasingness.…”
Section: Definition 2 Consider a Set C Of Equations Between Terms Whmentioning
confidence: 99%
“…4). Both unfeasibility and context-joinability rely on the notion of contextual rewriting, which we formalize together with the crucial lemma that contextual rewriting implies conditional rewriting for satisfying substitutions, a result that was stated without proof by Avenhaus and Loría-Sáenz [4,Lemma 4.2]. Unfeasibility further employs strong irreducibility, which like strong determinism is an undecidable property.…”
Section: Min (X:[])mentioning
confidence: 99%
See 3 more Smart Citations