We introduce a novel query optimization method based on pushing extrema and other integrity constraints into recursion. This optimization produces an efficient operational semantics for the goals declaratively specified by the original program that is stratified with respect to negation and aggregates. Complex algorithms can now be specified via simpler programs, and then implemented via optimi...

In functional and logic programming, parsers can be built as modular executable specifications of grammars, using parser combinators and definite clause grammars respectively. These techniques are based on top-down backtracking search. Commonly used implementations are inefficient for ambiguous languages, cannot accommodate left-recursive grammars, and require exponential space to represent par...

A composite object represented as a directed graph is an important data structure which requires efficient support in CAD/CAM, CASE, office systems, software management, Web databases and document databases. It is cumbersome to handle such an object in relational database systems when it involves recursive relationships. In this chapter, we present a new encoding method to support the efficient...

This paper presents an adaptive autoregressive (AR) approach to the blind image deconvolution problem which has several advantages over standard adaptive FIR filters. There is no need to figure out the optimum filter support when using an AR deconvolution filter because it is the same as the support of the blur. Thus there is no distortion introduced by the finite support of the FIR filter. Whi...

Solution of algebraic recursion relations in the most obvious fashion may produce unwieldy expressions. If the structure of the recursion is well understood, a better method may be to calculate the coefficient of each term in the answer by analysis of all ways in which that term can be generated by the reeursion relation. This technique has been applied with great success to the WKB (phase-inte...

The nature and origin of syntactic recursion in natural languages is a topical problem. Important recent contributions include those of Johansson (2005), Parker (2006), Tomalin (2006; 2007), and Heine and Kuteva (2007). Syntactic recursion will here be discussed especially in relation to its cognate concept of iteration. Their basic common feature is plain structural repetition: “keep on emitti...

We describe a second-order calculus of objects. The calculus supports object subsumption, method override, and the type Self. It is constructed as an extension of System F with subtyping, recursion, and first-order object types.

  In order to have better insight of project characteristics, different kinds of fuzzy analysis for project networks have been recently proposed, most of which consider activities duration as the main and only source of imprecision and vagueness, but as it is usually experienced in real projects, the structure of the network is also subject to changes. In this paper we consider three types of i...

This paper proposes a method of combining the concepts of recursive algorithms and functional programming in hardware design. Though recursion is readily available in functional programming languages, a translation step is required to convert the recursion in such functional program to a synthesizable hardware specification. This proposal uses the idea of Finite State Machines used in [5], comb...