1036 search results - page 10 / 208 » Natural Narrowing for General Term Rewriting Systems |
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
ICADL
2005
Springer
14 years 1 months ago
2005
Springer
Question answering (QA) is the study on the methodology that returns exact answers to natural language questions. This paper attempts to increase the coverage and accuracy of QA sy...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
SIGIR
2003
ACM
14 years 23 days ago
2003
ACM
This paper presents an algorithm to generate possible variants for biomedical terms. The algorithm gives each variant its generation probability representing its plausibility, whi...
ENTCS
2008
13 years 7 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...