A simple characterization of uniform boundedness for a class of recursions
- 31 May 1991
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 10 (3-4), 233-253
- https://doi.org/10.1016/0743-1066(91)90037-p
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Undecidable optimization problems for database logic programsJournal of the ACM, 1993
- Data independent recursion in deductive databasesJournal of Computer and System Sciences, 1989
- Minimizing function-free recursive inference rulesJournal of the ACM, 1989
- On Bounded Database Schemes and Bounded Horn-Clause ProgramsSIAM Journal on Computing, 1988
- Equivalences of Logic ProgramsPublished by Elsevier ,1988
- Logic Programming and Parallel ComplexityPublished by Elsevier ,1988
- A time bound on the materialization of some recursively defined viewsAlgorithmica, 1986
- Equivalences Among Relational Expressions with the Union and Difference OperatorsJournal of the ACM, 1980
- Equivalences among Relational ExpressionsSIAM Journal on Computing, 1979
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976