AI & ML
Answering Conjunctive Queries over Linear Existential Rules with Transitivity
arXiv cs.DB0 views
arXiv:2611.13138v1 Announce Type: new Abstract: We study Conjunctive Query Entailment Problem over ontologies con- sisting of Linear Tuple Generating Dependencies and transitivity asser- tions. A special case of this problem has been shown to be decidable in [1]. In particular, it covers the case of linear single head TGDs with bi- nary signature. In This paper we show that The problem for linear multi head TGDs with binary signature is Ackermanian hard
Source：https://arxiv.org/abs/2611.13138PreviousHow Many Demonstrations Does a VLA Need? On the Sample Efficiency of VLA FinetuningNextARoute: Task-Aligned Batch and Streaming Model Routing
Related posts
Five Details That Make a Bedroom Feel French, From Someone Who Sells French Bedding
0dev.to Design
User-Friendly Mobile App UX Design – Best Practice & Process
0dev.to Design
The empty states in my app blamed the user, so I wrote a linter for that
0dev.to Design
Generic CRMs made me hate CRM, so I built one with only my trade's stages
0dev.to Productivity
Think Before You Solve: The Importance of Planning in Software Engineering
0dev.to Productivity
Attention Fusion for Bridge Deck Delamination Detection
0arXiv eess.IV