Sciweavers

835 search results - page 100 / 167
» Structural Recursion as a Query Language
Sort
View
FOCS
1998
IEEE
14 years 1 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 2 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
ICVS
2003
Springer
14 years 2 months ago
A Self-Referential Perceptual Inference Framework for Video Interpretation
This paper presents an extensible architectural model for general content-based analysis and indexing of video data which can be customised for a given problem domain. Video interp...
Christopher Town, David Sinclair
EACL
1989
ACL Anthology
13 years 10 months ago
A Metaplan Model For Problem-Solving Discourse
The structure of problem-solving discourse in the expert advising setting can be modeled by adding a layer of metaplans to a plan-based model of the task domain. Classes of metapl...
Lance A. Ramshaw
MPC
2010
Springer
159views Mathematics» more  MPC 2010»
14 years 1 months ago
Subtyping, Declaratively
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
Nils Anders Danielsson, Thorsten Altenkirch