Sciweavers

96 search results - page 4 / 20
» Conditional Term Rewriting as a Deductive Database Language
Sort
View
ACMSE
2005
ACM
14 years 3 months ago
Metadata management and relational databases
A simple extension to the relational model that permits metadata (more generally metaknowledge) to be stored and manipulated as first class data is proposed. The accompanying que...
Shun Yan Cheung, James J. Lu, Catharine M. Wyss
SIGMOD
2008
ACM
143views Database» more  SIGMOD 2008»
14 years 10 months ago
XML query optimization in the presence of side effects
The emergence of database languages with side effects, notably for XML, raises significant challenges for database compilers and optimizers. In this paper, we extend an algebra fo...
Giorgio Ghelli, Nicola Onose, Kristoffer Hø...
AGP
1997
IEEE
14 years 2 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
CADE
2003
Springer
14 years 10 months ago
Source-Tracking Unification
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
Venkatesh Choppella, Christopher T. Haynes
ENTCS
2008
96views more  ENTCS 2008»
13 years 9 months ago
Maude as a Platform for Designing and Implementing Deep Inference Systems
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
Ozan Kahramanogullari