Filters








4,400 Hits in 5.3 sec

A simple characterization of uniform boundedness for a class of recursions

Jeffrey F. Naughton, Yehoshua Sagiv
1991 The Journal of Logic Programming  
We then specify a class of recursions C such that membership in C guarantees that a certain simple condition is necessary and sufficient for boundedness.  ...  We will use simple boundedness for boundedness when it is necessary to emphasize the contrast with uniform boundedness.  ... 
doi:10.1016/0743-1066(91)90037-p fatcat:4pghadnt3zfw5gxfojplhr72ie

Some positive results for boundedness of multiple recursive rules [chapter]

Ke Wang
1995 Lecture Notes in Computer Science  
only if it is a unit recursion. (3) The characterization of uniform unboundedness for linear sirups in NS] is extended to a substantial superclass called class C + . (4) Boundedness for class C + with  ...  multiple exit rules is decidable in polynomial space. (5) Predicate boundedness is decidable in doubly exponential time for a large class of Datalog programs that properly contains all connected monadic  ...  Extending the A/V Graph Approach In NS], uniform boundedness for a linear sirup in a class called C is characterized by absence of chain generating paths in the A/V graph of the linear sirup.  ... 
doi:10.1007/3-540-58907-4_29 fatcat:jw5xj4ulfzd7bkbio6pe7l4rxm

A time bound on the materialization of some recursively defined views

Yannis E. Ioannidis
1986 Algorithmica  
Considering a restricted class of recursive Horn clauses, we give necessary and sufficient conditions for members of the class to have this bound.  ...  A virtual relation (or view) can be defined with a recursive Horn clause that is a function of one or more base relations.  ...  I would like to give thanks to Professor Eugene Wong for all his valuable help and guidance. I am also deeply indebted to Timos Sellis for  ... 
doi:10.1007/bf01840452 fatcat:poxhsv5j5fdcfbgvs46ggfhat4

Volume contents to volume 10

1991 The Journal of Logic Programming  
Vardi SET CONSTRUCTORS IN A LOGIC DATABASE LANGUAGE Catriel Beeri, Shamim Naqvi, Oded Shmueli, and Shalom Tsur A SIMPLE CHARACTERIZATION OF UNIFORM BOUNDEDNESS FOR A CLASS OF RECURSIONS Jeffrey F  ...  Naughton and Yehoshua Sagiv ON THE POWER OF MAGIC Catriel Beeri and Raghu Ramakrishnan EFFICIENT EVALUATION FOR A SUBSET OF RECURSIVE QUERIES Gijsta Grahne, Seppo Sippu, and Eljas Soisalon-Soininen  ... 
doi:10.1016/0743-1066(91)90043-o fatcat:q73tqcvapzgt3eechpeage2dla

Page 435 of Mathematical Reviews Vol. , Issue 92a [page]

1992 Mathematical Reviews  
for a class of recursions.  ...  We then specify a class of recursions C such that membership in C guarantees that a certain simple condition is necessary and suffi- cient for boundedness.  ... 

Page 4098 of Mathematical Reviews Vol. , Issue 94g [page]

1994 Mathematical Reviews  
They can also be used to characterize both uniform 1-boundedness for single-rule programs and 1-boundedness for two-rule programs, when the programs belong to certain classes studied previously for the  ...  In addition, we provide an exact characterization for 1-boundedness of two-rule programs in which no EDB predicate is repeated in the recursive rule.”  ... 

Page 6232 of Mathematical Reviews Vol. , Issue 96j [page]

1996 Mathematical Reviews  
Paredaens are special cases of new dependen- cies. A characterization of a conditional implicational dependency implied by a given class in this family is given.  ...  machines to show that uniform boundedness is undecid- able for arity 3 predicates and for arity | predicates when + is also allowed; (3) by encoding all possible transitions of a two-counter machine in  ... 

Database logic programming

MosheY. Vardi
1991 The Journal of Logic Programming  
The next two papers deal with optimization of database logic programs. The paper "A Simple Characterization of Uniform Boundedness for a Class of Recursions", by J. F. Naughton and Y.  ...  Sagiv, deals with the detection of bounded recursion (i.e., recursion that has a data-independent bound on its depth).  ...  The paper "Comparison of Methods for Logic Query Implementation", by A. Marchetti-Spaccamela, A. Pelaggi, and D. Sac&, considers the class of canonical strongly linear programs.  ... 
doi:10.1016/0743-1066(91)90035-n fatcat:kizazk7lrna2tmf4tj6hjvb2gm

Page 5299 of Mathematical Reviews Vol. , Issue 2000h [page]

2000 Mathematical Reviews  
“We also characterize the provably recursive function(al)s of type <2 of the extensions of 7,” based on these fragments of arithmetical comprehension, choice and uniform boundedness.” 2000h:03105 03F05  ...  restricted forms of comprehension, choice and general uniform boundedness.  ... 

Page 4580 of Mathematical Reviews Vol. , Issue 96h [page]

1996 Mathematical Reviews  
We present a description of the congruence relation induced by a given ideal.” 96h:08002 08A30 08B05 08B10 Wang, Ju (PRC-ASBJ-SF; Beijing) Uniform minimal pairs, uniform boundedness, and the finite base  ...  pair for each principal congruence. (2) For such a variety, there exists a uniform bound on the lengths of the projectivities.  ... 

Using Session Types for Reasoning About Boundedness in the Pi-Calculus

Hans Hüttel
2017 Electronic Proceedings in Theoretical Computer Science  
The classes of depth-bounded and name-bounded processes are fragments of the pi-calculus for which some of the decision problems that are undecidable for the full calculus become decidable.  ...  In this paper we use binary session types to decise two type systems that give a sound characterization of the properties: If a process is well-typed in our first system, it is depth-bounded.  ...  Using session types for depth-boundedness We now present a session type system that gives a sound characterization of depth-boundedness.  ... 
doi:10.4204/eptcs.255.5 fatcat:xqtta5pym5bsxeeecvov65rejy

Page 2777 of Mathematical Reviews Vol. , Issue 2002D [page]

2002 Mathematical Reviews  
(C, — EC,)/n*~' for each of the classes converges weakly to a random variable which is characterized as a fixed point of a random affine operator.  ...  In particular, we solve the famous open problem of Kanellakis showing that uniform boundedness is undecidable for single rule programs (also called sirups).  ... 

Page 5679 of Mathematical Reviews Vol. , Issue 93j [page]

1993 Mathematical Reviews  
Our characterization provides a simple way of checking whether a join dependency is allowed on a 5NF relation R without any computation on tableau representation.”  ...  {For the entire collection see MR 93c:68002.} A. D. Booth (Sooke, BC) 93j:68045 68P10 Lau, Kung Kiu (4-MANC-C); Prestwich, Steven D. (4-MANC-C) Synthesis of a family of recursive sorting procedures.  ... 

Page 8920 of Mathematical Reviews Vol. , Issue 2002M [page]

2002 Mathematical Reviews  
Moreover, the Hausdorff dimension and the exact Hausdorff measure function are obtained for a class of statistically recursive sets.  ...  The authors give a characterization of the vector measures for which I,, is a compact operator.  ... 

Page 394 of Mathematical Reviews Vol. , Issue 93a [page]

1993 Mathematical Reviews  
93a:68037 operational and denotational semantics for a simple concurrent language with recursion, and prove that 7 = J.”  ...  We study these two notions for the class of free choice nets, and characterise the compositions (within this class) that preserve liveness (absence of partial or global deadlocks) and boundedness (absence  ... 
« Previous Showing results 1 — 15 out of 4,400 results