Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,322,382 papers from all fields of science
Search
Sign In
Create Free Account
Rewriting
Known as:
Trace rewriting system
, Rewrite rules
, Rewrite system
Expand
In mathematics, computer science, and logic, rewriting covers a wide range of (potentially non-deterministic) methods of replacing subterms of a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Abstract rewriting system
Algebraic Petri net
Binary combinatory logic
Compiler
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
A data-centric approach to synchronization
Julian T Dolby
,
Christian Hammer
,
Daniel Marino
,
F. Tip
,
M. Vaziri
,
J. Vitek
TOPL
2012
Corpus ID: 1470387
Concurrency-related errors, such as data races, are frustratingly difficult to track down and eliminate in large object-oriented…
Expand
2011
2011
A COMMUNITY-BASED STUDY ON AWARENESS AND PERCEPTION ON GENDER DISCRIMINATION AND SEX PREFERENCE AMONG MARRIED WOMEN (IN REPRODUCTIVE AGE-GROUP) IN A RURAL POPULATION OF DISTRICT BAREILLY UTTAR…
S. Shalini
,
P. Kariwal
,
S. Ram
,
Murti Smarak
,
S. Srivastav
2011
Corpus ID: 146513475
Background: Skewed sex ratio is an issue of major concern. The problem is getting worse with the misuse of technology that…
Expand
2007
2007
About quotient and division of crisp and fuzzy relations
P. Bosc
,
O. Pivert
,
D. Rocacher
Journal of Intelligence and Information Systems
2007
Corpus ID: 23693723
The role and properties of the division are very well known in the context of queries addressed to regular relational databases…
Expand
2006
2006
Learning dynamic audio-visual mapping with input-output Hidden Markov models
Yan Li
,
Harry Shum
IEEE Trans. Multim.
2006
Corpus ID: 12864093
In this paper, we formulate the problem of synthesizing facial animation from an input audio sequence as a dynamic audio-visual…
Expand
2002
2002
On Families of Graphs Having a Decidable First Order Theory with Reachability
Thomas Colcombet
International Colloquium on Automata, Languages…
2002
Corpus ID: 2906981
We consider a new class of infinite graphs defined as the smallest solution of equational systems with vertex replacement…
Expand
2001
2001
Gathering Knowledge for a Question Answering System from Heterogeneous Information Sources
Boris Katz
,
Jimmy J. Lin
,
Sue Felshin
HTLKM@ACL
2001
Corpus ID: 17012545
Although vast amounts of information are available electronically today, no effective information access mechanism exists to…
Expand
2001
2001
LETTER TO THE EDITOR: Can quantum chaos enhance the stability of quantum computation?
T. Prosen
,
M. Znidaric
2001
Corpus ID: 45641270
A combustor for a gas turbine includes a main fuel injector for receiving compressor discharge air and mixing the air with fuel…
Expand
1998
1998
Satisfiability - Algorithms and Logic
P. Pudlák
International Symposium on Mathematical…
1998
Corpus ID: 729986
We present some recent results on algorithms for satisfiability of k-CNF formulas: fastest probabilistic algorithms. We mention…
Expand
Review
1991
Review
1991
Disunification: A Survey.
H. Comon
1991
Corpus ID: 118923989
Solving an equation in an algebra of terms is known as uniication. Solving more complex formulas combining equations and…
Expand
1991
1991
Bidirectional Parsing of Lexicalized Tree Adjoining Grammars
A. Lavelli
,
G. Satta
Conference of the European Chapter of the…
1991
Corpus ID: 1826534
In this paper a bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE