default search action
Marco Calautti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Marco Calautti
, Ester Livshits
The Complexity of Why-Provenance for Datalog Queries. Proc. ACM Manag. Data 2(2): 83 (2024) - [j14]Marco Calautti
Combined Approximations for Uniform Operational Consistent Query Answering. Proc. ACM Manag. Data 2(2): 99 (2024) - [j13]Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider:
Below and Above Why-Provenance for Datalog Queries. Proc. ACM Manag. Data 2(5): 211:1-211:21 (2024) - [j12]Marco Calautti
Querying Data Exchange Settings Beyond Positive Queries. Theory Pract. Log. Program. 24(2): 250-278 (2024) - [c32]Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider
Computing the Why-Provenance for Datalog Queries via SAT Solvers. AAAI 2024: 10459-10466 - [c31]Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider:
Computing the Why-Provenance for Datalog Queries via SAT Solvers. SEBD 2024: 51-60 - [c30]Marco Calautti, Damiano Duranti, Paolo Giorgini:
Machine Learning-Augmented Ontology-Based Data Access for Renewable Energy Data. SEBD 2024: 431-445 - [i10]Marco Calautti, Damiano Duranti, Paolo Giorgini:
Machine Learning-Augmented Ontology-Based Data Access for Renewable Energy Data. CoRR abs/2410.12734 (2024) - 2023
- [j11]Gianvincenzo Alfano
Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks. Artif. Intell. 323: 103967 (2023) - [j10]Marco Calautti, Mostafa Milani, Andreas Pieris:
Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study. Proc. VLDB Endow. 16(11): 2858-2870 (2023) - [c29]Marco Calautti, Sergio Greco, Hebatalla Hammad, Tariq Mahmood, Cristian Molinaro, Irina Trubitsyna:
Querying Data Exchange Settings Beyond Positive Queries. SEBD 2023: 360-368 - [c28]Heba M. Wagih, Marco Calautti:
Enhancing Ontological Query-Rewriting via Parallelization. SEBD 2023: 401-409 - [i9]Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider
The Complexity of Why-Provenance for Datalog Queries. CoRR abs/2303.12773 (2023) - [i8]Marco Calautti, Mostafa Milani, Andreas Pieris:
Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study. CoRR abs/2303.12851 (2023) - [i7]Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna:
Querying Data Exchange Settings Beyond Positive Queries. CoRR abs/2307.03071 (2023) - [i6]Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider
Combined Approximations for Uniform Operational Consistent Query Answering. CoRR abs/2312.08038 (2023) - 2022
- [j9]Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna
Preference-based inconsistency-tolerant query answering under existential rules. Artif. Intell. 312: 103772 (2022) - [j8]Marco Calautti
Query answering over inconsistent knowledge bases: A probabilistic approach. Theor. Comput. Sci. 935: 144-173 (2022) - [c27]Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna:
Querying Data Exchange Settings Beyond Positive Queries. Datalog 2022: 27-41 - [c26]Marco Calautti, Georg Gottlob, Andreas Pieris:
Non-Uniformly Terminating Chase: Size and Complexity. PODS 2022: 369-378 - [c25]Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider
Uniform Operational Consistent Query Answering. PODS 2022: 393-402 - [c24]Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider
Counting Database Repairs Entailing a Query: The Case of Functional Dependencies. PODS 2022: 403-412 - [c23]Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider:
Counting Database Repairs Entailing a Query: The Case of Functional Dependencies. SEBD 2022: 159-166 - [c22]Marco Calautti, Luciano Caroprese, Sergio Greco, Cristian Molinaro, Irina Trubitsyna, Ester Zumpano:
Active Integrity Constraints with Existential Quantification. SEBD 2022: 284-291 - [i5]Marco Calautti, Georg Gottlob, Andreas Pieris:
Non-Uniformly Terminating Chase: Size and Complexity. CoRR abs/2204.10584 (2022) - [i4]Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider
Uniform Operational Consistent Query Answering. CoRR abs/2204.10592 (2022) - 2021
- [j7]Marco Calautti, Luciano Caroprese
Existential active integrity constraints. Expert Syst. Appl. 168: 114297 (2021) - [j6]Pablo Barceló, Marco Calautti:
Special Issue on Database Theory. Theory Comput. Syst. 65(1): 1-2 (2021) - [j5]Marco Calautti, Andreas Pieris:
Semi-Oblivious Chase Termination: The Sticky Case. Theory Comput. Syst. 65(1): 84-121 (2021) - [c21]Marco Calautti, Marco Console, Andreas Pieris:
Benchmarking Approximate Consistent Query Answering. PODS 2021: 233-246 - [c20]Marco Calautti, Marco Console, Andreas Pieris:
Benchmarking Approximate Consistent Query Answering (Discussion Paper). SEBD 2021: 209-216 - [c19]Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna:
Preference-based Inconsistency-Tolerant Query Answering under Existential Rules (Discussion Paper). SEBD 2021: 217-225 - [i3]Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider:
Counting Database Repairs Entailing a Query: The Case of Functional Dependencies. CoRR abs/2112.09617 (2021) - 2020
- [c18]Marco Calautti, Luciano Caroprese, Sergio Greco
Consistent query answering with prioritized active integrity constraints. IDEAS 2020: 3:1-3:10 - [c17]Gianvincenzo Alfano
Explainable Acceptance in Probabilistic Abstract Argumentation: Complexity and Approximation. KR 2020: 33-43 - [c16]Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna:
Preference-based Inconsistency-Tolerant Query Answering under Existential Rules. KR 2020: 203-212 - [c15]Marco Calautti, Nicola Fiorentino, Sergio Greco, Cristian Molinaro, Irina Trubitsyna:
Probabilistic Answers over Inconsistent Knowledge Bases. SEBD 2020: 48-55
2010 – 2019
- 2019
- [c14]Marco Calautti, Andreas Pieris:
Oblivious Chase Termination: The Sticky Case. ICDT 2019: 17:1-17:18 - [c13]Marco Calautti
Counting Database Repairs under Primary Keys Revisited. PODS 2019: 104-118 - [c12]Marco Calautti, Marco Console, Andreas Pieris:
Counting Database Repairs under Primary Keys Revisited. SEBD 2019 - [e1]Pablo Barceló, Marco Calautti:
22nd International Conference on Database Theory, ICDT 2019, March 26-28, 2019, Lisbon, Portugal. LIPIcs 127, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-101-6 [contents] - 2018
- [c11]Marco Calautti, Leonid Libkin, Andreas Pieris:
An Operational Approach to Consistent Query Answering. AMW 2018 - [c10]Marco Calautti
An Operational Approach to Consistent Query Answering. PODS 2018: 239-251 - [p1]Marco Calautti, Luciano Caroprese
Dealing with Inconsistency in Databases: An Overview. A Comprehensive Guide Through the Italian Database Research 2018: 143-167 - 2017
- [j4]Marco Calautti
Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols. ACM Trans. Comput. Log. 18(4): 28:1-28:42 (2017) - 2016
- [j3]Marco Calautti
Exploiting Equality Generating Dependencies in Checking Chase Termination. Proc. VLDB Endow. 9(5): 396-407 (2016) - [j2]Marco Calautti
Using linear constraints for logic program termination analysis. Theory Pract. Log. Program. 16(3): 353-377 (2016) - [c9]Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna:
Leveraging Equality Generating Dependencies for Chase Termination. SEBD 2016: 94-101 - 2015
- [j1]Marco Calautti
Checking termination of bottom-up evaluation of logic programs with function symbols. Theory Pract. Log. Program. 15(6): 854-889 (2015) - [c8]Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna:
Rewriting-based Check of Chase Termination. AMW 2015 - [c7]Marco Calautti, Georg Gottlob, Andreas Pieris:
Chase Termination for Guarded Existential Rules. AMW 2015 - [c6]Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna:
Logic Program Termination Analysis Using Atom Sizes. IJCAI 2015: 2833-2839 - [c5]Marco Calautti
Chase Termination for Guarded Existential Rules. PODS 2015: 91-103 - [c4]Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna:
Checking Termination of Datalog with Function Symbols Through Linear Constraints. SEBD 2015: 192-199 - [i2]Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna:
Using Linear Constraints for Logic Program Termination Analysis. CoRR abs/1512.04097 (2015) - 2014
- [c3]Marco Calautti
Checking Termination of Logic Programs with Function Symbols through Linear Constraints. RuleML 2014: 97-111 - [c2]Marco Calautti, Cristian Molinaro, Chiara Pulice, Irina Trubitsyna:
Termination Criteria for Datalog with Function Symbols. SEBD 2014: 248-255 - [i1]Marco Calautti, Sergio Greco, Francesca Spezzano, Irina Trubitsyna:
Checking Termination of Bottom-Up Evaluation of Logic Programs with Function Symbols. CoRR abs/1407.2106 (2014) - 2013
- [c1]Marco Calautti
Detecting decidable classes of finitely ground logic programs with function symbols. PPDP 2013: 239-250
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-09 22:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: