Sciweavers

234 search results - page 5 / 47
» Deduction, Strategies, and Rewriting
Sort
View
IDEAS
2009
IEEE
142views Database» more  IDEAS 2009»
14 years 2 months ago
A magic approach to optimizing incremental relational expressions
This paper is concerned with a transformation-based approach to update propagation in an extended version of Codd’s relational algebra which allows for defining derived relatio...
Andreas Behrend
ENTCS
2008
96views more  ENTCS 2008»
13 years 7 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
DEDUCTIVE
1993
140views Database» more  DEDUCTIVE 1993»
13 years 9 months ago
AMOS: A Natural Language Parser Implemented as a Deductive Database in LOLA
In this paper we present the set-oriented bottom-up parsing system AMOS which is a major application of the deductive database system LOLA. AMOS supports the morpho-syntactical an...
Günther Specht, Burkhard Freitag
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 7 months ago
Definitions by Rewriting in the Calculus of Constructions
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
Frédéric Blanqui
TCS
2002
13 years 7 months ago
ELAN from a rewriting logic point of view
ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or ...
Peter Borovanský, Claude Kirchner, Hé...