86,797 Hits in 6.2 sec

Page 3419 of Mathematical Reviews Vol. , Issue 83h [page]

1983 Mathematical Reviews  
On the role of blocking in Acta Cybernet. 5, no. 4, 389-408 (1982).  ...  This paper initiates the formal investigation of the role that the nonblocking restriction has on the language-generating power of various classes of rewriting systems.  ... 

Smarter Features, Simpler Learning? [article]

Sarah Winkler, Georg Moser
2019 arXiv   pre-print
We present some ideas for features of term rewrite systems and theorem proving problems.  ...  Using ideas adopted in the software verification community, we propose the investigation of more complex, structural features to learn from.  ...  Moreover, for particular types of rewrite systems, further roles become important: In higher-order systems, argument positions can be divided into first-and higher-order ones.  ... 
arXiv:1911.06578v1 fatcat:2khhaqvefbbubml3pxsrowya6y

Only prime superpositions need be considered in the Knuth-Bendix completion procedure

Deepak Kapur, David R. Musser, Paliath Narendran
1988 Journal of symbolic computation  
This test has been implemented in the completion procedures for ordinary term rewriting systems as well as term rewriting systems with assoeiative-commutative operators.  ...  The Knuth and Bendix test for local confluence of a term rewriting system involves generating $uperposifions of the left-hand sides, and for each superposition deriving a critical pair of terms and checking  ...  Sivakumar for implementing the check for blocked crltinal pairs in RRL and running some experinaents for us.  ... 
doi:10.1016/s0747-7171(88)80019-1 fatcat:5hm5qmlfs5gi5bkot6o6ftxeru

K Overview and SIMPLE Case Study

Grigore Roşu, Traian Florin Şerbănuţă
2014 Electronical Notes in Theoretical Computer Science  
Function names evaluate to function abstractions, which are ordinary values in the language, like the array references. • Blocks with locals.  ...  K Syntax The K syntax of languages, calculi or systems, as well as the additional syntax needed for the semantics of these, is defined using context-free grammars (CFG) or, equivalently, algebraic signatures  ...  The rewrite relation ≡ K associated to a K rewrite system K = (Σ, S, C) gives us an obvious transition system on T Σ , which can be regarded as the semantics of K.  ... 
doi:10.1016/j.entcs.2014.05.002 fatcat:7nnbyrzpibbmxj7q3jpqlp6lim

Macros that work

William Clinger
1991 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '91  
This paper describes a modified form of Kohlbecker's algorithm for reliably hygienic (capture-free) macro expansion in block-structured languages, where macros are source-tosource transformations specified  ...  Unlike previous algorithms, the modified algorithm runs in linear instead of quadratic time, copies few constants, does not assume that syntactic keywords (e.g. if) are reserved words, and allows local  ...  Acknowledgements The authors thank an anonymous member of the program committee who helped us to write the introduction. Jim O'Toole and Mark Sheldon provided helpful comments on drafts of the paper.  ... 
doi:10.1145/99583.99607 dblp:conf/popl/ClingerR91 fatcat:az3fhhh67bfkvgawc66or2uasm

The taming of the rew: a type theory with computational assumptions

Jesper Cockx, Nicolas Tabareau, Théo Winterhalter
2021 Proceedings of the ACM on Programming Languages (PACMPL)  
We further describe an algorithm to check that the triangle criterion indeed holds for a given rewrite system, as well as our implementation of rewrite rules for the Agda system, in Sect. 7.  ...  The properties of RTT have been formally verified using the MetaCoq framework and an implementation of rewrite rules is already available in the Agda proof assistant.  ...  The first square bracket in the syntax of a rewrite block gathers all the axioms of the block, while the second one gathers the rewrite rules.  ... 
doi:10.1145/3434341 fatcat:nuswqtklpfgi3f6xmkzfksnudi

A Tile Logic Based Approach for Software Architecture Description Analysis

Aïcha Choutri, Faiza Belala, Kamel Barkaoui
2010 Journal of Software Engineering and Applications  
Both other sub-LfP-BD describe roles of block transitions worker (by a not detailed simple transition) and daem e respectively.  ...  ms Method-TS and Bloc-TS Block-TS , N Block-TS , R Block-TS ) is deion is method-TS defined in the underlined sub-LfP-BD in terms of n sub LfP-BD specified in LfP architecture d (by two possible not  ...  practical checking tools [21,2 way to several other perspectives such as semantics enrichment of LfP component behaviour under particular constraints such dynamic reco  ... 
doi:10.4236/jsea.2010.311126 fatcat:b4gqvgucoffv3jaobcyxjibqca

Rewriting systems, plain groups, and geodetic graphs [article]

Murray Elder, Adam Piggott
2021 arXiv   pre-print
We prove that a group is presented by finite convergent length-reducing rewriting systems where each rule has left-hand side of length 3 if and only if the group is plain.  ...  Our proof goes via a new result concerning properties of embedded circuits in geodetic graphs, which may be of independent interest in graph theory.  ...  The authors thank the anonymous reviewer for helpful feedback and corrections.  ... 
arXiv:2009.02885v2 fatcat:c63cz7w4vbhbdgiispaa4huqdq

Privacy-Aware Data Sharing in a Tree-Based Categorical Clustering Algorithm [chapter]

Mina Sheikhalishahi, Mohamed Mejri, Nadia Tawbi, Fabio Martinelli
2016 Lecture Notes in Computer Science  
The proposed methodology is based on rewriting systems, and automatically generates a global structure of the clusters. We prove that the proposed approach improves the time complexity.  ...  Despite being one of the most common approaches in unsupervised data analysis, a very small literature exists in applying formal methods to address data mining problems.  ...  Namely, the attribute "color" is the one which appears in all the blocks of term τ.  ... 
doi:10.1007/978-3-319-51966-1_11 fatcat:3rgyrvwdkjgk5iyygmitvb4t5q

Access control for XML

Sriram Mohan, Arijit Sengupta, Yuqing Wu
2005 Proceedings of the 14th ACM international conference on Information and knowledge management - CIKM '05  
In this context, we adopt and extend a graph editing language for specifying role-based access constraints in the form of security views.  ...  To enforce the access constraints on user queries, we propose Secure Query Rewrite (SQR) -a set of rules that can be used to rewrite a user XPath query on the security view into an equivalent XQuery expression  ...  The Secure Query Rewrite component (on the right) rewrites the user queries (in XPath) into equivalent target queries (in XQuery) against the original schema, using the information in the SAS.  ... 
doi:10.1145/1099554.1099612 dblp:conf/cikm/MohanSW05 fatcat:afxnrpyb4rel5obv64ig7astce

$\mathcal{EL}$ -ifying Ontologies [chapter]

David Carral, Cristina Feier, Bernardo Cuenca Grau, Pascal Hitzler, Ian Horrocks
2014 Lecture Notes in Computer Science  
The OWL 2 profiles are fragments of the ontology language OWL 2 for which standard reasoning tasks are feasible in polynomial time.  ...  We investigate techniques for rewriting axioms into the EL and RL profiles of OWL 2. We have tested our techniques on both classification and data reasoning tasks with encouraging results.  ...  over such role, a system should reuse a suitable distinguished individual instead of generating a fresh one.  ... 
doi:10.1007/978-3-319-08587-6_36 fatcat:5qft5q2zzjhlpgiyqr3nuaqngq

Remedy of Mixed Initiative Conflicts in Model-based System Engineering

Fenglin Han, Peter Herrmann
2012 Electronic Communications of the EASST  
One of the strengths of its tool-set Arctis is that the system engineercan formally analyze the models for design errors such that these can becorrected early in the development process.  ...  Usinggraph rewriting rules, we can analyze the state space graph of a system for the exact reason of an error as well as remove the erroneous parts of a model by changing themodel description.  ...  The engineer has to determine which component should take the role of the primary party in order to identify which of the two mixed initiative blocks needs to be built in. 2.  ... 
doi:10.14279/tuj.eceasst.47.717 dblp:journals/eceasst/HanH12 fatcat:3k5skjy7ufbp3dejvkzvqlk4di

Pregeometric Spaces from Wolfram Model Rewriting Systems as Homotopy Types [article]

Xerxes D. Arsiwalla, Jonathan Gorard
2021 arXiv   pre-print
To address this, we investigate non-deterministic rewriting systems (multiway systems) of the Wolfram model. We express these rewriting systems as homotopy types.  ...  We then go on to show how this construction extends to the classifying space of rulial multiway systems, which forms a multiverse of multiway systems and carries the formal structure of an (∞, 1)-topos  ...  Acknowledgments The authors would like to thank Stephen Wolfram for his encouragement, and for the many conversations that helped shape this work.  ... 
arXiv:2111.03460v2 fatcat:ckmayfudijgmvil4tua6hfjpmi

Commentary: Rewriting the Valuation and Salience of Alcohol-Related Stimuli via Memory Reconsolidation

Udi E. Ghitza
2016 Frontiers in Psychiatry  
Neuroadaptations of neuronal ensembles in the mesocorticolimbic reward system mediate memory processes, which link drug-seeking experiences to the contexts in which they occur (1-3).  ...  A commentary on Rewriting the valuation and salience of alcohol-related stimuli via memory reconsolidation by Das RK, Lawn W, Kamboj SK. Transl Psychiatry (2015) 5:e645.  ...  A commentary on Rewriting the valuation and salience of alcohol-related stimuli via memory reconsolidation by Das Neuroadaptations of neuronal ensembles in the mesocorticolimbic reward system mediate  ... 
doi:10.3389/fpsyt.2016.00041 pmid:27014104 pmcid:PMC4794481 fatcat:hifae4izhbgobpx526suztravm

Program Transformation Using HATS 1.84 [chapter]

Victor Winter, Jason Beranek
2006 Lecture Notes in Computer Science  
This article gives an overview of a transformation system called HATS -a freely available platform independent IDE facilitating experimentation in transformation-oriented software development.  ...  Examples are discussed highlighting how the transformational abstractions provided by HATS can be used to solve various problems.  ...  When applied to the assignments in a multi-assignment, the rewrite rule derived from check[id 1 ] will apply if id 1 occurs on the left-hand side of an assignment within the multiassignment block.  ... 
doi:10.1007/11877028_15 fatcat:silmf5bbc5a3dadsgbt2fanwkq
« Previous Showing results 1 — 15 out of 86,797 results