1385 search results - page 67 / 277 » Natural Rewriting for General Term Rewriting Systems |
206
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
271
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
208
click to vote
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
137
click to vote
TPLP
2010
15 years 4 months ago
2010
Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers,...
166
click to vote
DEXA
1993
Springer
15 years 10 months ago
1993
Springer
We describe an integration of the hypermedia system HyperPATH with the object-oriented DBMS (OODBMS) O¡ . Providing persistence to a hypertext system was the first motivation of...