Undecidability and intractability results concerning datalog programs and their persistency numbers

Stavros S. Cosmadakis,Eugénie Foustoucos,Anastasios Sidiropoulos

ACM Trans. Comput. Log.（2010）

引用 2|浏览8

暂无评分

摘要

F.1.1 [Computation,by abstract,devices]: Models of Computation—Automata; Bounded- action devices; Computability,theory ; F.1.3 [Computation,by abstract,devices]: Complexity Measures,and,Classes—Reducibility; F.4.2 [Mathematical,Logic,and,Formal,Languages]: Formal,Languages—Decision,Problems; H.2.3 [Database,Management]: Languages—Query Languages General Terms: Algorithms, Languages, Theory Additional Key Words and Phrases: Datalog, bounded treewidth hypergraphs, Persistent vari- ables, Persistency numbers, Boundedness, Undecidability, Intractability Authors’ addresses: Stavros Cosmadakis, University of Patras, 26500 Rio, Patras, Greece, email:

查看译文

关键词

datalog,formal language,decision problem,query language,computability theory,database management

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要