Filters








192 Hits in 2.8 sec

Page 6059 of Mathematical Reviews Vol. , Issue 2002H [page]

2002 Mathematical Reviews  
2002h:68094 68Q42 Ayala-Rincon, Mauricio (BR-BRSL; Brasilia) Church-Rosser property for conditional rewriting systems with built-in predicates as premises.  ...  (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.  ... 

New decision algorithms for finitely presented commutative semigroups

A.M. Ballantyne, D.S. Lankford
1981 Computers and Mathematics with Applications  
application of uniformly terminating Church-Rosser term rewriting systems to the solved and open decision problems of algebra. 159  ...  -Rosser equivalence class term rewriting systems decide equivalence of words in constant space.  ...  For the moment it is not necessary to know the precise details of the Church-Rosser decision algorithm, but only that it halts if the term rewriting system is Church-Rosser, and outputs a finite number  ... 
doi:10.1016/0898-1221(81)90115-2 fatcat:xna4flrc7je4re2erx6wrdqhze

Learning of human-like algebraic reasoning using deep feedforward neural networks

Cheng-Hao Cai, Yanyan Xu, Dengfeng Ke, Kaile Su
2018 Biologically Inspired Cognitive Architectures  
Briefly, in a reasoning system, a deep feedforward neural network is used to guide rewriting processes after learning from algebraic reasoning examples produced by humans.  ...  There is a wide gap between symbolic reasoning and deep learning. In this research, we explore the possibility of using deep learning to improve symbolic reasoning.  ...  After multiple small systems have been designed, they can be combined into a whole system, because the direct sum of two Church-Rosser systems holds the same property [Toyama, 1987] .  ... 
doi:10.1016/j.bica.2018.07.004 fatcat:tsevplqak5gcljvbkhwt2ix7ia

Thue systems as rewriting systems

Ronald V. Book
1987 Journal of symbolic computation  
The emphasis is on Thue systems with the Chureh-Rosser property, where the notion of reduction is based on length-decreasing rewriting rules.  ...  This paper is a survey of recent results on Thue systems, where the systems are viewed as rewriting systems on strings over a finite alphabet.  ...  For example, one might investigate the types of groups or monoids that are finitely generated but are presented by infinite regular or infinite context-free Church-Rosser Thue systems.  ... 
doi:10.1016/s0747-7171(87)80021-4 fatcat:pqx6qbrwmngcdfsj6mabwfrxce

Representing Languages by Learnable Rewriting Systems [chapter]

Rémi Eyraud, Colin de la Higuera, Jean-Christophe Janodet
2004 Lecture Notes in Computer Science  
Among the formalisms that allow to define classes of languages, the one of stringrewriting systems (SRS) has outstanding properties.  ...  Powerful methods and algorithms are known to learn regular languages. Aiming at extending them to more complex grammars, we choose to change the way we represent these languages.  ...  Moreover, every subsystem of an ANo DSRS is an ANo DSRS, and thus Church-Rosser.  ... 
doi:10.1007/978-3-540-30195-0_13 fatcat:tssc3vscvzb6rab22gf4ypfscm

Page 2744 of Mathematical Reviews Vol. , Issue 99d [page]

1991 Mathematical Reviews  
Klop, Origin tracking in term rewriting (1); Satoshi Okui, Simultaneous critical pairs and Church-Rosser prop- erty (2-16); Enno Ohlebusch, Church-Rosser theorems for abstract reduction modulo an equivalence  ...  Schmidt, E-unification for subsystems of S4 (106-120); Sébastien Limet and Pierre Réty, Solving disequations modulo some class of rewrite systems (121-135); Hubert Comon, About proofs by consistency (abstract  ... 

Saturation-based theorem proving: Past successes and future potential [chapter]

Harald Ganzinger
1996 Lecture Notes in Computer Science  
dynamic logic with converse p. 613 Reflection of formal tactics in a deductive reflection framework p. 628 Walther recursion p. 643 Path indexing for AC-theories p. 718 More Church-Rosser  ...  compilation: the achievement by cycle search p. 493 Rewrite semantics for production rule systems: theory and applications p. 508 Experiments in the heuristic use of past proof experience p. 523  ... 
doi:10.1007/3-540-61511-3_64 fatcat:iizfu32trnfadmj4z7xcvwds5y

LARS: A learning algorithm for rewriting systems

Rémi Eyraud, Colin de la Higuera, Jean-Christophe Janodet
2006 Machine Learning  
Among the formalisms that allow the definition of classes of languages, the one of string-rewriting systems (SRS) has outstanding properties.  ...  Whereas there is a number of methods and algorithms to learn regular languages, moving up the Chomsky hierarchy is proving to be a challenging task.  ...  Acknowledgments We thank Géraud Sénizergues (LaBRI, Bordeaux, France) for providing us with pointers to the rewriting systems literature, as well as Alexander Clark (Royal Holloway University of London  ... 
doi:10.1007/s10994-006-9593-8 fatcat:bvg2oieuu5fs7i4uephzciek2i

Book reports

Ervin Y. Rodin
1993 Computers and Mathematics with Applications  
nitary church-rosser property for non-collapsing orthogonal term rewriting systems. 5. The functional strategy and transitive term rewriting sys- tems. 6.  ...  A lattice for the abstract interpretation of term graph rewriting systems. 11. Event structures and orthogonal term graph rewriting. 12.  ... 
doi:10.1016/0898-1221(93)90008-j fatcat:zk4j7psgrncyletmai4mmdscba

Page 2089 of Mathematical Reviews Vol. , Issue 2002C [page]

2002 Mathematical Reviews  
Woinowski, Prefix languages of Church-Rosser languages (516-529). {Some of the papers are being reviewed individually. } For the web version of Mathematical Reviews, see http: //www.ams.org/mathscinet  ...  systems (127-138).  ... 

Theorem Proving and Algebra [article]

Joseph A. Goguen
2021 arXiv   pre-print
constants; interpretation and equivalence of theories; term rewriting, termination, confluence and normal form; abstract rewrite systems; standard models, abstract data types, initiality, and induction  ...  ; rewriting and deduction modulo equations; first-order logic, models, and proof planning; second-order algebra; order-sorted algebra and rewriting; modules; unification and completion; and hidden algebra  ...  In this case we write t As usual, ⇒ A, B gives an abstract rewriting system, so we automatically get the appropriate notions of termination, Church-Rosser, canonical, and local Church-Rosser for weak  ... 
arXiv:2101.02690v2 fatcat:2unv7ebr7zdprpjrcme5pmgkvi

Page 2797 of Mathematical Reviews Vol. , Issue 91E [page]

1991 Mathematical Reviews  
decision processes and regular events (extended abstract) (pp. 336-349); Jan Willem Klop, Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond (pp. 350-369); 68 COMPUTER SCIENCE 91¢:68005  ...  Ramakrishnan, Nonoblivious normal- ization algorithms for nonlinear rewrite systems (pp. 370-385); Catuscia Palamidessi, Algebraic properties of idempotent substitu- tions (pp. 386-399). David P.  ... 

Page 7094 of Mathematical Reviews Vol. , Issue 97K [page]

1997 Mathematical Reviews  
Oleshchuk], On public-key cryptosystem based on Church-Rosser string-rewriting systems (extended abstract) (264-269); John E.  ...  order-sorted term rewriting systems (191-202); S.  ... 

Page 8490 of Mathematical Reviews Vol. , Issue 2002K [page]

2002 Mathematical Reviews  
Woinowski, A normal form for Church-Rosser language systems (322-337); Toshiyuki Yamada, Confluence and termination of simply typed term rewriting systems (338-352); Jorge Sousa Pinto, Parallel evaluation  ...  tree automata (201-215); Salvador Lucas, Transfinite rewriting se- mantics for term rewriting systems (216-230); Christopher Lynch and Barbara Morawska, Goal-directed E-unification (231-245); Michio Oyamaguchi  ... 

Term Rewriting on GPUs [article]

Johri van Eerd, Jan Friso Groote, Pieter Hijma, Jan Martens, Anton Wijs
2020 arXiv   pre-print
We find that if the term rewrite systems exhibit sufficient internal parallelism, GPU rewriting substantially outperforms the CPU.  ...  We present a way to implement term rewriting on a GPU. We do this by letting the GPU repeatedly perform a massively parallel evaluation of all subterms.  ...  We recall that a term rewriting system that enjoys the Church-Rosser property is parallel in nature, in a sense that rewriting can take place at any point in the system and the order in which it takes  ... 
arXiv:2009.07174v1 fatcat:e7wbeeq7xjghljhpxk7k4zxm7m
« Previous Showing results 1 — 15 out of 192 results