Undecidable optimization problems for database logic programs
- 1 July 1993
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 40 (3), 683-713
- https://doi.org/10.1145/174130.174142
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the Expressive Power of Datalog: Tools and a Case StudyJournal of Computer and System Sciences, 1995
- A simple characterization of uniform boundedness for a class of recursionsThe Journal of Logic Programming, 1991
- Boundedness is undecidable for datalog programs with a single recursive ruleInformation Processing Letters, 1989
- Minimizing function-free recursive inference rulesJournal of the ACM, 1989
- Relational queries computable in polynomial timeInformation and Control, 1986
- Implementation of logical query languages for databasesACM Transactions on Database Systems, 1985
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- On the foundations of the universal relation modelACM Transactions on Database Systems, 1984
- On compiling queries in recursive first-order databasesJournal of the ACM, 1984
- Efficient optimization of a class of relational expressionsACM Transactions on Database Systems, 1979