Folgen
Marco Calautti
Titel
Zitiert von
Zitiert von
Jahr
Chase termination for guarded existential rules
M Calautti, G Gottlob, A Pieris
Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2015
432015
An operational approach to consistent query answering
M Calautti, L Libkin, A Pieris
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2018
312018
Explainable acceptance in probabilistic abstract argumentation: Complexity and approximation
G Alfano, M Calautti, S Greco, F Parisi, I Trubitsyna
Proceedings of the 17th International Conference on Principles of Knowledge …, 2020
262020
Exploiting equality generating dependencies in checking chase termination
M Calautti, S Greco, C Molinaro, I Trubitsyna
Proceedings of the VLDB Endowment (PVLDB) 9 (5), 396-407, 2016
252016
Preference-based inconsistency-tolerant query answering under existential rules
M Calautti, S Greco, C Molinaro, I Trubitsyna
Artificial Intelligence 312, 103772, 2022
192022
Counting database repairs under primary keys revisited
M Calautti, M Console, A Pieris
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2019
192019
Checking termination of bottom-up evaluation of logic programs with function symbols
M Calautti, S Greco, F Spezzano, I Trubitsyna
Theory and Practice of Logic Programming 15 (6), 854-889, 2015
162015
Detecting decidable classes of finitely ground logic programs with function symbols
M Calautti, S Greco, I Trubitsyna
Proceedings of the 15th Symposium on Principles and Practice of Declarative …, 2013
162013
Benchmarking approximate consistent query answering
M Calautti, M Console, A Pieris
Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2021
152021
Oblivious chase termination: The sticky case
M Calautti, A Pieris
22nd International Conference on Database Theory (ICDT 2019), 2019
152019
Existential active integrity constraints
M Calautti, L Caroprese, S Greco, C Molinaro, I Trubitsyna, E Zumpano
Expert Systems with Applications 168, 114297, 2021
122021
Checking termination of logic programs with function symbols through linear constraints
M Calautti, S Greco, C Molinaro, I Trubitsyna
Rules on the Web. From Theory to Applications: 8th International Symposium …, 2014
122014
Logic program termination analysis using atom sizes
M Calautti, S Greco, C Molinaro, I Trubitsyna
Proceedings of the Twenty-Fourth International Joint Conference on …, 2015
112015
Counting database repairs entailing a query: The case of functional dependencies
M Calautti, E Livshits, A Pieris, M Schneider
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022
92022
Semi-oblivious chase termination: The sticky case
M Calautti, A Pieris
Theory of Computing Systems 65, 84-121, 2021
92021
Detecting decidable classes of finitely ground logic programs with function symbols
M Calautti, S Greco, I Trubitsyna
ACM Transactions on Computational Logic (TOCL) 18 (4), 1-42, 2017
82017
Non-uniformly terminating chase: Size and complexity
M Calautti, G Gottlob, A Pieris
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022
72022
Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
G Alfano, M Calautti, S Greco, F Parisi, I Trubitsyna
Artificial Intelligence 323, 103967, 2023
62023
Uniform operational consistent query answering
M Calautti, E Livshits, A Pieris, M Schneider
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022
62022
Query answering over inconsistent knowledge bases: A probabilistic approach
M Calautti, S Greco, C Molinaro, I Trubitsyna
Theoretical Computer Science 935, 144-173, 2022
52022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20