Filters








26,680 Hits in 3.2 sec

Structured contextual rewriting [chapter]

Qian Zhenyu
1987 Lecture Notes in Computer Science  
qian Abstract In this paper, we develop a m e c h a n i s m , which we call structured contextual system, (SCS for short,) to deal with some non-finitely-based algebraic specifications.  ...  Structured Contextual System The notion of structured contextual system (SCS for short) is developed to describe some non-finitely-based equational systems or TRS's, without the need to introduce any auxiliary  ...  Definition 9 (SCS) A structured contextual TRS (short: SCS) is a triple <Sb,E,E> such that E is a finite set of SCR's.  ... 
doi:10.1007/3-540-17220-3_15 fatcat:5rjf3q7eu5ddfiihmm5qnbz3a4

Page 1967 of Mathematical Reviews Vol. , Issue 2001C [page]

2001 Mathematical Reviews  
In this way we also obtain a very general class of contextual gram- mars such that most of the fundamental classes of contextual grammars, for instance, internal contextual grammars, external contextual  ...  The categorical framework also allows us to model in a concise way automatic garbage collection and rules for sharing/unsharing and folding/unfolding of structures, and to relate term graph rewriting to  ... 

Page 270 of Computational Linguistics Vol. 24, Issue 2 [page]

1998 Computational Linguistics  
A structure for the words generated by a contextual grammar can be introduced in various ways. By parenthesizing the contexts, we get a tree.  ...  phrase-linkage structures produced by a link grammar.  ... 

Page 6366 of Mathematical Reviews Vol. , Issue 97J [page]

1997 Mathematical Reviews  
Length-2-loops turn out to have a unique structure, whereas one-rule systems admitting a 3-loop (but no 2-loop) can belong to three structurally different types.” 97j:68070 68Q42 03B35 03C05 68N17 68T15  ...  The (x, y)-contextual deletion operation is defined in a similar way.  ... 

P Systems on Hexagonal Picture Languages and Applications

S. James Immanuel, S. Jayasankar, D. Gnanaraj Thomas
2022 International Symposium on Artificial Intelligence and Mathematics  
Their systems yield languages of hexagons using parallel rewriting relations.  ...  The area of membrane computing, was initiated by Paun [15] introducing a new computability model, now called as P system, which is distributed highly parallel theoretical model inspired by the membrane structure  ...  One uses the Chomsky way of rewriting for computations, in a P system with string objects.  ... 
dblp:conf/isaim/ImmanuelJT22 fatcat:bdtt3t7v6zas7ftinjqu2ttxoa

Contextualized Rewriting for Text Summarization [article]

Guangsheng Bao, Yue Zhang
2021 arXiv   pre-print
In this paper, we investigate contextualized rewriting, which ingests the entire original document.  ...  We formalize contextualized rewriting as a seq2seq problem with group alignments, introducing group tag as a solution to model the alignments, identifying extracted summaries through content-based addressing  ...  This shows the effectiveness of contextualized rewriting.  ... 
arXiv:2102.00385v2 fatcat:vjdaogwn55htzpm3xobawyde2u

Page 3785 of Mathematical Reviews Vol. , Issue 88g [page]

1988 Mathematical Reviews  
Summary: “Fuzzy extensions of the contextual grammars intro- duced by S. Marcus are defined.  ...  Random-context structure grammars that generate three-dimensional digital structures are introduced.  ... 

RDF/SPARQL Design Pattern for Contextual Metadata

Olivier Corby, Catherine Faron-Zucker
2007 IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)  
We propose a slight syntactic extension to SPARQL to facilitate the query of context hierarchies, together with rewriting rules to return to standard SPARQL.  ...  This is a first step to handle contextual metadata. Based on it, we present in this paper a design pattern to handle contextual metadata hierarchically organized.  ...  As a result, let us consider a tree structure of contextual metadata as depicted in figure 1.  ... 
doi:10.1109/wi.2007.162 dblp:conf/webi/CorbyF07 fatcat:u5nyfp5pdjcjldfw66heln4uhi

Frontmatter, Table of Contents, Preface, Workshop Organization

Manfred Schmidt-Schauß, Masahiko Sakai, David Sabel, Yuki Chiba, Marc Herbstritt
2014 International Conference on Rewriting Techniques and Applications  
In this paper we operationalize structural congruence by providing a reduction relation for pi-processes which also performs necessary structural conversions explicitly by rewrite rules.  ...  As we show, a subset of structural congruence axioms is sufficient.  ... 
doi:10.4230/oasics.wpte.2014.i dblp:conf/rta/X14 fatcat:irftn5gdzjgyrh37ff5n3ir334

Page 5644 of Mathematical Reviews Vol. , Issue 2004g [page]

2004 Mathematical Reviews  
We call this generalized form of contextual rewriting constraint contextual rewriting (CCR for short).  ...  The first step amounts to a generaliza- tion of contextual rewriting which allows the available decision procedure to access and manipulate the rewriting context.  ... 

Concurrency for Graph Grammars in a Petri net shell

P Baldan
2004 Electronical Notes in Theoretical Computer Science  
A basic role is played by the study of contextual and inhibitor nets, two extensions of ordinary nets which can be seen as intermediate models between graph grammars and ordinary Petri nets.  ...  rewriting step.  ...  From the unfolding we extract an (appropriate kind of) event structure, the transformation being expressed as a functor from O-Sys to the considered category of event structures ES (in the case of contextual  ... 
doi:10.1016/s1571-0661(04)00192-6 fatcat:wrvdeitwenf43ltcatn5oqkp2q

Sorted dependency insertion grammars

Radu Gramatovici, Carlos Martín-Vide
2006 Theoretical Computer Science  
An enhanced generative formalism is proposed based on the combination of two features: contextual derivation (as in Marcus contextual grammars) and sorted dependency structures (as in dependency grammars  ...  The model is related to a variant of restarting automaton with rewriting and deletion.  ...  Consequently, a dependency tree will be generated by a set of hybrid rules, in which the word order is imposed by the contextual mechanism, while the dependency structure is constructed by tree rewriting  ... 
doi:10.1016/j.tcs.2005.11.012 fatcat:ywf3artdfvaudp3zpkpcmsuioa

Constraint contextual rewriting

Alessandro Armando, Silvio Ranise
2003 Journal of symbolic computation  
We call this generalized form of contextual rewriting constraint contextual rewriting (CCR for short).  ...  The first step amounts to a generalization of contextual rewriting which allows the available decision procedure to access and manipulate the rewriting context.  ...  It is worth pointing out that contextual rewriting differs from conventional rewriting in two essential ways. Firstly proofs do not have a linear structure.  ... 
doi:10.1016/s0747-7171(03)00025-7 fatcat:j2dhgo72u5b6jjxblwsn3y3jgq

Page 7661 of Mathematical Reviews Vol. , Issue 95m [page]

1995 Mathematical Reviews  
The theory of 2-structures was introduced by Ehrenfeucht and Rozenberg [Theoret. Comput. Sci. 70 (1990), no. 3, 277-303; MR 91c:05170]. T-structures form a subclass of 2-structures.  ...  Paun [Contextual grammars (Romanian), Ed. Acad.  ... 

An implementation of narrowing

Alan Josephson, Nachum Dershowitz
1989 The Journal of Logic Programming  
structure.  ...  The structure of these unifiers is identical to that of a contextual narrowing tree, and they can in fact be computed using an appropriate set of rules.  ... 
doi:10.1016/0743-1066(89)90030-7 fatcat:fwfzzbr2vrh6fln6uzwern7biu
« Previous Showing results 1 — 15 out of 26,680 results