A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
If the bi-rewrite system is Church-Rosser and quasi-terminating then the decision procedure is sound, complete and terminates, therefore the satisfiability problem is decidable. ... We can prove the following results for the decision procedure based on a bi-rewrite system, and the Ax POL t ⊆ u deduction problem of its corresponding inclusion theory. Lemma 2.5. ... a R ⊆ , R ⊇ bi-rewrite system modulo I. ...doi:10.1006/jsco.1996.0053 fatcat:m3a5qrmrsnfc3mmcnmebiqscle
Lecture Notes in Computer Science
Instead of using only a rewriting relation ⊆ −→ and rewriting a to b, we use another rewriting relation ⊇ ... We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. ... The Newman's lemma is also true in bi-rewriting systems: a terminating bi-rewriting system is Church-Rosser iff it is locally biconfluent. ...doi:10.1007/3-540-56868-9_3 fatcat:vousksgjb5g23gcc5cwvp3vxba
c cases of bi-rewrite systems. ... In this paper I propose to tend towards the operational semantics for such languages by basing it on bi-rewrite systems and ordered chaining calculi which apply rewrite techniques to rst-order theories ... to bi-rewrite systems. ...doi:10.1016/s1571-0661(04)00043-x fatcat:k4tkrluwffenbfbzate2gvj3le
To prove an inclusion a C } from a given set J of them, we generate from /, using a completion procedure, a bi-rewrite system (Rc, R>), that is, a pair of rewrite relations “i and at and seek a common ... We also extend the existing techniques of rewriting modulo equalities to bi-rewriting modulo a set of inclusions. ...
In this work, we introduce an approach that takes the hypotheses produced by a state-ofthe-art, reranked phrase-based SMT system, and explores new parts of the search space by applying rewriting rules ... We show that if an indication of which phrases require rewriting is provided, our automatic rewriting procedure yields an additional improvement of 1.5 BLEU. ... In other configurations we mixed a) the neighborhood of the reranker n-best hypotheses computed by our system on the development set using a rewriting phrase table containing the bi-phrases found in the ...doi:10.3115/v1/d14-1133 dblp:conf/emnlp/MarieM14 fatcat:yffejdv7ljbx5mf2vxid6j2oce
The confluence of untyped lambda-calculus with unconditional rewriting has already been studied in various directions. ... This extends results of Muller and Dougherty for unconditional rewriting. Two cases are considered, whether beta-reduction is allowed or not in the evaluation of conditions. ... We define the β-standard rewrite relation induced by R as → B = i≥0 → Bi where → B0 = ∅ and for all i ≥ 0, → Bi+1 is the smallest rewrite relation such that for all rule d = c ⊃ l → r ∈ R, for all σ, if ...arXiv:cs/0609002v1 fatcat:dtw6coxnj5dgxgxedpn3u5bulq
Lecture Notes in Computer Science
The confluence of untyped λ-calculus with unconditional rewriting has already been studied in various directions. ... In this paper, we investigate the confluence of λ-calculus with conditional rewriting and provide general results in two directions. First, when conditional rules are algebraic. ... We define the β-standard rewrite relation induced by R as → B = i≥0 → Bi where → B0 = ∅ and for all i ≥ 0, → Bi+1 is the smallest rewrite relation such that for all rule d = c ⊃ l → r ∈ R, for all σ, if ...doi:10.1007/11690634_26 fatcat:o3tkznadkndfvg4ibpvohdrg6y
We have developed an operational semantics for these inequality spec- ifications named bi-rewriting systems. ... In the first case, we give a canonical bi-rewriting system implementing the basic theory of these alge- bras. ...
The author’s method extends earlier approaches and is not lim- ited to term rewriting: it also applies to various other reduction systems (Thue systems, graph rewriting, A-calculus). ... A term rewriting system is a reduction system where A is the set 7(F,V) of terms over a set F of function symbols and a set V of variables, and — is a set of rewrite rules (/,r): /¢V, and any variable ...
Model checking techniques are set up to automatically establish such a bi-simulation. A case study is used to illustrate how the approach works. ... Each task model is represented by a labelled state-transitions system (lts). Due to the use of different interaction modes and devices, the obtained lts have different set of labels. ... Second, the definition of the rewriting function should be automated. We are currently investigating how this function can be encoded within rewriting systems like Maude. ...doi:10.1109/tase.2015.25 dblp:conf/tase/ChebiebA15 fatcat:dmcg3e56mnfdjlpque2vnimcxe
Lecture Notes in Computer Science
In parallel, several software systems based on rewriting have been developed for the easy modeling and prototyping of systems using rules controlled by strategies. ... This paper presents our current experience in using the rewrite system ELAN for prototyping the automatic generation of the combustion reactions mechanisms previously implemented in the EXGAS kinetic mechanism ... The aim of our study is to use rewrite systems for automatic generation mechanisms. ...doi:10.1007/3-540-44863-2_37 fatcat:sy5ph72od5h77lpnsbxmlp3zli
They give a rich view of the latest developments and research directions in the field of rewriting logic and its different applications to computing. ... logical and metalogical specification; on reflection and strategies; on applications to object-oriented design, specification and programming; and on applications to constraint solving, to real-time systems ... cases of bi-rewrite systems. ...doi:10.1016/s0304-3975(97)00247-8 fatcat:3cfgzbipsrenxoh5vxznnvaxl4
In this paper, we propose the conversational query rewriting model - MLR, which is a Multi-task model on sequence Labeling and query Rewriting. ... Conversational context understanding aims to recognize the real intention of user from the conversation history, which is critical for building the dialogue system. ... Bi-LSTM layer We use two layer Bi-LSTM to encode all queries. ...arXiv:2004.05812v1 fatcat:uzo47py2rfe5xkehqh2bc3a3wa
(F-LILL-FI; Villeneuve d’Ascq) Synchronization languages and rewriting systems. (English summary) ISTCS’96 (Jerusalem). Inform. and Comput. 167 (2001), no. 1, 46-69. The rewriting systems of [L. ... It is also shown that it is impossible to obtain a complete characterization of synchronization languages in terms of closure under any rewriting system of regular languages. ...
As for termination, it generally fails even for multiset rewriting systems that satisfy certain natural invariant balance conditions. ... systems in question. ... Acknowledgements Since the paper used techniques from the rewriting world (see [3, 4, 10] ) to sort out speciÿc mathematical problems studied completely independently in the world of combinatorics (see ...doi:10.1016/j.disc.2004.01.017 fatcat:f2fmuy7q4vdkvjkn7je3pzyr2u
« Previous Showing results 1 — 15 out of 58,725 results