Author:
Meier Michael,Schmidt Michael,Wei Fang,Lausen Georg
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference47 articles.
1. A proof procedure for data dependencies;Beeri;J. ACM,1984
2. M. Bruynooghe, J.P. Gallagher, W.V. Humbeeck, Inference of well-typings for logic programs with application to termination analysis, in: SAS, 2005, pp. 35–51.
3. Interaction between path and type constraints;Buneman;ACM Trans. Comput. Log.,2003
4. A. Calì, G. Gottlob, M. Kifer, Taming the infinite chase: Query answering under expressive relational constraints, in: KR, 2008, pp. 70–80.
5. A. Calì, G. Gottlob, T. Lukasiewicz, B. Marnette, A. Pieris, Datalog+/−: A family of logical knowledge representation and query languages for new applications, in: LICS, 2010, pp. 228–242.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献