Sciweavers

23201 search results - page 41 / 4641
» Rewriting Systems with Data
Sort
View
122
Voted
COOPIS
2003
IEEE
15 years 6 months ago
Ontology Based Query Processing in Database Management Systems
The use of semantic knowledge in its various forms has become an important aspect in managing data in database and information systems. In the form of integrity constraints, it ha...
Chokri Ben Necib, Johann Christoph Freytag
89
Voted
FPCA
1987
15 years 4 months ago
Categorical multi-combinators
: Categorical Multi-Combinators form a rewriting system developed with the aim of providing efficient implementations of lazy functional languages. The core of the system of Catego...
Rafael Dueire Lins
97
Voted
RTA
2010
Springer
15 years 2 months ago
Underspecified computation of normal forms
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
Alexander Koller, Stefan Thater
102
Voted
ENTCS
2002
76views more  ENTCS 2002»
15 years 18 days ago
Four equivalent equivalences of reductions
Two co-initial reductions in a term rewriting system are said to be equivalent if they perform the same steps, albeit maybe in a different order. We present four characterisations...
Vincent van Oostrom, Roel C. de Vrijer
104
Voted
JFLP
2002
101views more  JFLP 2002»
15 years 14 days ago
Complete Selection Functions for a Lazy Conditional Narrowing Calculus
In this paper we extend the lazy narrowing calculus lnc of Middeldorp, Okui, and Ida [26] to conditional rewrite systems. The resulting lazy conditional narrowing calculus lcnc is...
Aart Middeldorp, Taro Suzuki, Mohamed Hamada