Boundedness is undecidable for datalog programs with a single recursive rule-Reference-Cited by-同舟云学术

Boundedness is undecidable for datalog programs with a single recursive rule

Author:

Abiteboul Serge

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference11 articles.

1. Decidable optimization problems for database logic programs;Cosmadakis;Proc. 20th ACM STOC,1988

2. Parallel evaluation of recursive rule queries;Cosmadakis;Proc. 5th ACM Symp. on Principles of Database Systems,1986

3. Undecidable optimization problems for database logic programs;Gaifman;Proc. 2nd Symp. on Logic in Computer Science,1987

4. A time bound on the materialization of some recursively defined views;Ioannidis;Proc. 11th Internat. Conf. on Very Large Data Bases,1985

5. Logic programming and parallel complexity;Kanellakis,1988

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deciding Boundedness of Monadic Sirups;Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2021-06-20

2. Characterizing Boundedness in Chase Variants;Theory and Practice of Logic Programming;2020-06-04

3. A Step Up in Expressiveness of Decidable Fixpoint Logics;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05

4. The Complexity of Boundedness for Guarded Logics;2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science;2015-07

5. The Complexity of Datalog on Linear Orders;Logical Methods in Computer Science;2009-02-27