The DOI matches its Crossref record, with a small difference in title or year; 37 of the 40 references it cites were found in a registry or an index.
Data exchange: semantics and query answering
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“Data exchange research [12] addresses cross-boundary consistency but not privacy-preserving forgetting over an evolving state trajectory.”
From Is Agent Memory a Database? Rethinking Data Foundations for Long-Term AI Agent Memory (2026) · cites this paper as [12]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Data integration: a theoretical perspective
Maurizio Lenzerini, B. (2002) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/543613.543644 · Cited by 2,578
The complexity of satisfiability problems
Schaefer, T. J. (1978) · Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 · doi:10.1145/800133.804350 · Cited by 1,737
Answering queries using views: A survey
Halevy, A. Y. (2001) · The VLDB Journal · doi:10.1007/s007780100054 · Cited by 1,510
Optimal implementation of conjunctive queries in relational data bases
Chandra, A. K., & Merlin, P. M. (1977) · Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77 · doi:10.1145/800105.803397 · Cited by 1,224
The complexity of relational query languages (Extended Abstract)
Vardi, M. Y. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802186 · Cited by 1,184
Testing implications of data dependencies
Maier, D., Mendelzon, A. O., & Sagiv, Y. (1979) · ACM Transactions on Database Systems · doi:10.1145/320107.320115 · Cited by 582
Levy, A. Y., Mendelzon, A. O., Sagiv, Y., & Srivastava, D. (1999) · The MIT Press eBooks · doi:10.7551/mitpress/4472.003.0012 · Cited by 538
Complexity of answering queries using materialized views
Abiteboul, S., & Duschka, O. M. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275516 · Cited by 483
Popa, L., Velegrakis, Y., Miller, R. J., Hernández, M. A., & Fagin, R. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50059-7 · Cited by 444
Self-citationSchema Mapping as Query Discovery
Miller, R. J., Haas, L. M., & Hernández, M. A. (2000) · Very Large Data Bases · Cited by 438
Self-citation
Cited by
Items 401–500 of 1,001
Value invention in data exchange
Arocena, P. C., Glavic, B., & Miller, R. J. (2013) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2463676.2465311 · Cited by 17
Self-citationLaconic schema mappings: computing core universal solutions by means of SQL queriesPreprint
ten Cate, B., Chiticariu, L., Kolaitis, P. G., & Tan, W. C. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0903.1953 · Cited by 17
Self-citationDatalog: Bag Semantics via Set SemanticsPreprint
Bertossi, L., Gottlob, G., & Pichler, R. (2018) · arXiv (Cornell University) · doi:10.4230/lipics.icdt.2019.16 · Cited by 17
A Single Approach to Decide Chase Termination on Linear Existential RulesPreprint
Leclère, M., Mugnier, M.-L., Thomazo, M., & Ulliana, F. (2018) · arXiv (Cornell University) · doi:10.4230/lipics.icdt.2019.18 · Cited by 17
Ontology-Mediated Queries for Probabilistic Databases
Borgwardt, S., Ceylan, İ. İ., & Lukasiewicz, T. (2017) · doi:10.25368/2023.218 · Cited by 17
State-boundedness in data-aware dynamic systems
Hariri, B. B., Calvanese, D., Montali, M., & Deutsch, A. (2014) · Cited by 16
Towards Scalable Hybrid Stores: Constraint-Based Rewriting to the Rescue
Alotaibi, R., Bursztyn, D., Deutsch, A., Manolescu, I., & Zampetakis, S. (2019) · HAL · doi:10.5446/42985 · Cited by 16
Query rewriting under non-guarded rules
Calì, A., Gottlob, G., & Pieris, A. (2010) · BIROn (Birkbeck, University of London) · Cited by 16
Integrating ETL Processes from Information Requirements
Jovanović, P., Romero, O., Simitsis, A., & Abelló, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32584-7_6 · Cited by 16
The ESTEEM platform: enabling P2P semantic collaboration through emerging collective knowledge
Montanelli, S., Bianchini, D., Aiello, C., Baldoni, R., Bolchini, C., Bonomi, S., Castano, S., Catarci, T., Antonellis, V. D., Ferrara, A., et al. (2010) · Journal of Intelligent Information Systems · doi:10.1007/s10844-010-0125-4 · Cited by 16
Querying incomplete data over extended ER schemata
Calì, A., & Martinenghi, D. (2010) · Theory and Practice of Logic Programming · doi:10.1017/s1471068410000104 · Cited by 16
Semantic query optimization in the presence of types
Meier, M., Schmidt, M., Wei, F., & Lausen, G. (2010) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1807085.1807102 · Cited by 16
Exploiting equality generating dependencies in checking chase termination
Calautti, M., Greco, S., Molinaro, C., & Trubitsyna, I. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/2876473.2876475 · Cited by 16
Complexity Results for Probabilistic Datalog
İlkan, C. İ., Lukasiewicz, T., & Rafael, P. (2016) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-61499-672-9-1414 · Cited by 16
A Collective, Probabilistic Approach to Schema Mapping Using Diverse Noisy Evidence
Kimmig, A., Memory, A., Miller, R. J., & Getoor, L. C. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2865785 · Cited by 16
Self-citationFoundations of information integration under bag semantics
Hernich, A., & Kolaitis, P. G. (2017) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.2017.8005104 · Cited by 16
Self-citationNested dependencies: structure and reasoning
Kolaitis, P. G., Pichler, R., Sallinger, E., & Savenkov, V. (2014) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/2594538.2594544 · Cited by 16
Self-citationWhat is the IQ of your data transformation system?
Mecca, G., Papotti, P., Raunich, S., & Santoro, D. (2012) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2396761.2396872 · Cited by 16
MISM: A Platform for Model-Independent Solutions to Model Management Problems
Atzeni, P., Bellomarini, L., Bugiotti, F., & Gianforme, G. (2009) · Journal on Data Semantics · doi:10.1007/978-3-642-10562-3_5 · Cited by 16
Stable Model Semantics for Tuple-Generating Dependencies Revisited
Alviano, M., Morak, M., & Pieris, A. (2017) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/3034786.3034794 · Cited by 16
First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries
Barceló, P., Berger, G., Lutz, C., & Pieris, A. (2018) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2018/236 · Cited by 16
Interactive Mapping Specification with Exemplar Tuples
Bonifati, A., Comignani, U., Coquery, E., & Thion, R. (2019) · ACM Transactions on Database Systems · doi:10.1145/3321485 · Cited by 16
Simplifying Information Integration: Object-Based Flow-of-Mappings Framework for Integration
Alexe, B., Gubanov, M. N., Hernández, M. A., Ho, H., Huang, J.-W., Katsis, Y., Popa, L. C., Saha, B., & Stanoi, I. (2009) · Lecture notes in business information processing · doi:10.1007/978-3-642-03422-0_9 · Cited by 16
Self-citationXML with incomplete information: models, properties, and query answering
Barceló, P., Libkin, L. O., Poggi, A., & Sirangelo, C. (2009) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1559795.1559832 · Cited by 16
Non-invasive lightweight integration engine for building EHR from autonomous distributed systems
Angulo, C., Crespo, P., Maldonado, J. A., Moner, D., Pérez, D., Abad, I., Mandingorra, J., & Robles, M. (2007) · International Journal of Medical Informatics · doi:10.1016/j.ijmedinf.2007.05.002 · Cited by 16
Baldoni, R., G., C., & F., D. (2006) · Cited by 16
Checking Chase Termination: Cyclicity Analysis and Rewriting Techniques
Greco, S., Spezzano, F., & Trubitsyna, I. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2339816 · Cited by 15
Approximation algorithms for querying incomplete databases
Greco, S., Molinaro, C., & Trubitsyna, I. (2019) · Information Systems · doi:10.1016/j.is.2019.03.010 · Cited by 15
Explanations for Inconsistency-Tolerant Query Answering under Existential Rules
Lukasiewicz, T., Malizia, E., & Molinaro, C. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i03.5682 · Cited by 15
Generating SPARQL Executable Mappings to Integrate Ontologies
Rivero, C. R., Hernández, I., Ruiz, D., & Corchuelo, R. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24606-7_10 · Cited by 15
Toward a General Framework for Multimodal Big Data Analysis
Bellandi, V., Ceravolo, P., Maghool, S., & Siccardi, S. (2022) · Big Data · doi:10.1089/big.2021.0326 · Cited by 15
Federated Data Integration in Data Spaces
Jarke, M., & Quix, C. (2022) · Springer eBooks · doi:10.1007/978-3-030-93975-5_11 · Cited by 15
Preference-based inconsistency-tolerant query answering under existential rules
Calautti, M., Greco, S., Molinaro, C., & Trubitsyna, I. (2022) · Artificial Intelligence · doi:10.1016/j.artint.2022.103772 · Cited by 15
Pushing the Boundaries of Tractable Ontology Reasoning
Carral, D., Feier, C., Grau, B. C., Hitzler, P., & Horrocks, I. R. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11915-1_10 · Cited by 15
Default Negation for Non-Guarded Existential Rules
Alviano, M., & Pieris, A. (2015) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/2745754.2745758 · Cited by 15
Challenges of knowledge evolution in practice
Falkner, A. A., & Haselböck, A. (2013) · AI Communications · doi:10.3233/aic-120542 · Cited by 15
Saccà, D., Serra, E., & Guzzo, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28472-4_20 · Cited by 15
Towards Farsighted Dependencies for Existential Rules
Baget, J.-F., Mugnier, M.-L., & Thomazo, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23580-1_4 · Cited by 15
A Declarative Approach to Data-Driven Fact Checking
Leblay, J. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10492 · Cited by 15
Certain Answers Meet Zero-One Laws
Libkin, L. O. (2018) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/3196959.3196983 · Cited by 15
Inconsistency-Tolerant Query Rewriting for Linear Datalog+/–
Lukasiewicz, T., Martínez, M. V., & Simari, G. I. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32925-8_13 · Cited by 15
Intensional Semantics for P2P Data Integration
Majkić, Z. (2006) · Lecture notes in computer science · doi:10.1007/11803034_3 · Cited by 15
Meier, M. (2013) · The VLDB Journal · doi:10.1007/s00778-013-0333-y · Cited by 15
A logical toolbox for ontological reasoning
Calì, A., Gottlob, G., Lukasiewicz, T., & Pieris, A. (2011) · ACM SIGMOD Record · doi:10.1145/2070736.2070738 · Cited by 15
Fagin, R., Kimelfeld, B., & Kolaitis, P. G. (2010) · International Conference on Database Theory · doi:10.1145/1804669.1804681 · Cited by 15
Self-citationPolynomial time queries over inconsistent databases with functional dependencies and foreign keys
Molinaro, C., & Greco, S. (2010) · Data & Knowledge Engineering · doi:10.1016/j.datak.2010.02.007 · Cited by 15
Estimating Data Integration and Cleaning Effort
Papotti, P., Naumann, F., & Kruse, S. (2015) · Movebank · doi:10.5441/002/edbt.2015.07 · Cited by 15
Combining existential rules with the power of CP-theories
Noia, T. D., Lukasiewicz, T., Martínez, M. V., Simari, G. I., & Tifrea-Marciuska, O. (n.d.) · Oxford University Research Archive (ORA) (University of Oxford) · Cited by 15
Verification of Description Logic Knowledge and Action Bases
Babak, B. H., Calvanese, D., Giuseppe, D. G., Masellis, R. D., Felli, P., & Montali, M. (2012) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-61499-098-7-103 · Cited by 14
Finite model reasoning over existential rules
Amendola, G., Leone, N., & Manna, M. (2017) · Theory and Practice of Logic Programming · doi:10.1017/s1471068417000369 · Cited by 14
Composing local-as-view mappings: closure and applications
Arocena, P. C., Fuxman, A. D., & Miller, R. J. (2010) · International Conference on Database Theory · doi:10.1145/1804669.1804696 · Cited by 14
Self-citationXML Schema Mappings: Data Exchange and Metadata Management
Amano, S., David, C., Libkin, L. O., & Murlak, F. (2014) · Journal of the ACM · doi:10.1145/2590773 · Cited by 14
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/– under Cardinality-Based Repairs
Lukasiewicz, T., Malizia, E., & Vaicenavičius, A. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33012962 · Cited by 14
Bienvenu, M., Leclère, M., Mugnier, M.-L., & Rousset, M.-C. (2020) · Springer eBooks · doi:10.1007/978-3-030-06164-7_6 · Cited by 14
The structure of inverses in schema mappings
Fagin, R., & Nash, A. (2010) · Journal of the ACM · doi:10.1145/1857914.1857915 · Cited by 14
Self-citationCreating Nested Mappings with Clio
Hernández, M. A., Ho, H., Popa, L. C., Fuxman, A. D., Miller, R. J., Fukuda, T., & Papotti, P. (2007) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2007.369046 · Cited by 14
Self-citationData Integration and Data Exchange: It's Really About Time.
Roth, M. T., & Tan, W.-C. (2013) · Cited by 14
Ontology Pattern-Based Data Integration
Krisnadhi, A. A. (2015) · Journal of Bioresource Management · Cited by 14
Kolaitis, P. G., Pichler, R., Sallinger, E., & Savenkov, V. (2017) · Theory of Computing Systems · doi:10.1007/s00224-017-9812-7 · Cited by 14
Self-citationAnnotation paths for matching XML-Schemas
Köpke, J. (2017) · Data & Knowledge Engineering · doi:10.1016/j.datak.2017.12.002 · Cited by 14
Ontology-Mediated Query Answering over Log-Linear Probabilistic Data
Borgwardt, S., Ceylan, İ. İ., & Lukasiewicz, T. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33012711 · Cited by 14
Normalization and optimization of schema mappings
Gottlob, G., Pichler, R., & Savenkov, V. (2011) · The VLDB Journal · doi:10.1007/s00778-011-0226-x · Cited by 14
Hannula, M., Kontinen, J., & Virtema, J. (2020) · Journal of Logic and Computation · doi:10.1093/logcom/exaa048 · Cited by 14
Calì, A., Gottlob, G., Orsi, G., & Pieris, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28729-9_1 · Cited by 14
Transaction processing in a peer to peer database network
Masud, M., & Kiringa, I. (2010) · Data & Knowledge Engineering · doi:10.1016/j.datak.2010.12.003 · Cited by 14
Data Exchange: Query Answering for Incomplete Data Sources
Afrati, F., Li, C., & Pavlaki, V. (2008) · Scalable Information Systems · doi:10.4108/icst.infoscale2008.3476 · Cited by 14
Afrati, F., & Chirkova, R. Y. (2019) · Synthesis lectures on data management · doi:10.1007/978-3-031-01871-8_7 · Cited by 14
Exchanging OWL 2 QL Knowledge BasesPreprint
Arenas, M., Botoeva, E., Calvanese, D., & Ryzhikov, V. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.5810 · Cited by 14
Conjunctive query answering under existential rules : decidability, complexity and algorithms
Thomazo, M. (2013) · theses.fr (ABES) · doi:10.70675/fc497447zba7cz4de9z9d0ezfb1031d0427c · Cited by 14
Computational Social Choice Meets Databases
Kimelfeld, B., Kolaitis, P. G., & Stoyanovich, J. (2018) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2018/44 · Cited by 13
Self-citationThe Space-Efficient Core of Vadalog
Berger, G., Gottlob, G., Pieris, A., & Sallinger, E. (2019) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/3294052.3319688 · Cited by 13
Exploring Theories with a Model-Finding Assistant
Saghafi, S., Danas, R. A., & Dougherty, D. J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21401-6_30 · Cited by 13
Fine-grained disclosure control for app ecosystems
Bender, G., Kot, Ł., Gehrke, J. E., & Koch, C. E. (2013) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2463676.2467798 · Cited by 13
Computing universal models under guarded TGDs
Hernich, A. (2012) · International Conference on Database Theory · doi:10.1145/2274576.2274600 · Cited by 13
A Unified View of Data-Intensive Flows in Business Intelligence Systems: A Survey
Jovanović, P., Romero, O., & Abelló, A. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-54037-4_3 · Cited by 13
Franconi, E., Mosca, A., Oriol, X., Rull, G., & Teniente, E. (2018) · Software & Systems Modeling · doi:10.1007/s10270-018-0688-z · Cited by 13
Consistent query answering under inclusion dependencies
Bravo, L., & Bertossi, L. (2004) · Conference of the Centre for Advanced Studies on Collaborative Research · Cited by 13
When Can We Answer Queries Using Result-Bounded Data Interfaces?
Amarilli, A., & Benedikt, M. (2018) · Logical Methods in Computer Science · doi:10.46298/lmcs-18(2:14)2022 · Cited by 13
SOME MODEL THEORY OF GUARDED NEGATION
Bárány, V., Benedikt, M., & ten Cate, B. (2018) · Journal of Symbolic Logic · doi:10.1017/jsl.2018.64 · Cited by 13
Database Constraints and Homomorphism Dualities
ten Cate, B., Kolaitis, P. G., & Tan, W.-C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15396-9_38 · Cited by 13
Self-citationOn the complexity of deriving schema mappings from database instances
Senellart, P. P., & Gottlob, G. (2008) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1376916.1376921 · Cited by 13
Jajodia, S., & Strous, L. A. M. (2004) · IFIP International Federation for Information Processing/IFIP · doi:10.1007/b116855 · Cited by 13
Revisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic NegationPreprint
Baget, J.-F., Garreau, F., Mugnier, M.-L., & Rocher, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.1071 · Cited by 13
Enhancing Existential Rules by Closed-World Variables
Amendola, G., Leone, N., Manna, M., & Veltri, P. (2018) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2018/232 · Cited by 12
On benchmarking data translation systems for semantic-web ontologies
Rivero, C. R., Hernández, I., Ruiz, D., & Corchuelo, R. (2011) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2063576.2063810 · Cited by 12
On the Interaction of Functional and Inclusion Dependencies with Independence Atoms
Hannula, M., & Link, S. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-91458-9_21 · Cited by 12
Capturing Homomorphism-Closed Decidable Queries with Existential Rules
Bourgaux, C., Carral, D., Krötzsch, M., Rudolph, S., & Thomazo, M. (2021) · Principles of Knowledge Representation and Reasoning · doi:10.24963/kr.2021/14 · Cited by 12
Automated reasoning on UML conceptual schemas with derived information and queries
Farré, C., Queralt, A., Rull, G., Teniente, E., & Urpí, T. (2013) · Information and Software Technology · doi:10.1016/j.infsof.2013.02.010 · Cited by 12
Query optimization in information integration
Chen, D., Chirkova, R. Y., Sadri, F., & Salo, T. (2013) · Acta Informatica · doi:10.1007/s00236-013-0179-1 · Cited by 12
Exchanging Data amongst Linked Data applications
Rivero, C. R., Hernández, I., Ruiz, D., & Corchuelo, R. (2012) · Knowledge and Information Systems · doi:10.1007/s10115-012-0587-5 · Cited by 12
Terminating Evaluation of Logic Programs with Finite Three-Valued Models
Riguzzi, F., & Swift, T. (2014) · ACM Transactions on Computational Logic · doi:10.1145/2629337 · Cited by 12
A runtime approach to model-generic translation of schema and data
Atzeni, P., Bellomarini, L., Bugiotti, F., Celli, F., & Gianforme, G. (2011) · Information Systems · doi:10.1016/j.is.2011.11.003 · Cited by 12
Checking termination of bottom-up evaluation of logic programs with function symbols
Calautti, M., Greco, S., Spezzano, F., & Trubitsyna, I. (2014) · Theory and Practice of Logic Programming · doi:10.1017/s1471068414000623 · Cited by 12
Knowledge base exchange: The case of OWL 2 QL
Arenas, M., Botoeva, E., Calvanese, D., & Ryzhikov, V. (2016) · Artificial Intelligence · doi:10.1016/j.artint.2016.05.002 · Cited by 12
Most Probable Explanations for Probabilistic Database Queries
Ceylan, İ. İ., Borgwardt, S., & Lukasiewicz, T. (2017) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/132 · Cited by 12
Answering Threshold Queries in Probabilistic Datalog+/– Ontologies
Gottlob, G., Lukasiewicz, T., & Simari, G. I. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23963-2_31 · Cited by 12
Explanations for Negative Query Answers under Inconsistency-Tolerant Semantics
Lukasiewicz, T., Malizia, E., & Molinaro, C. (2022) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2022/375 · Cited by 12
Answering Non-Monotonic Queries in Relational Data Exchange
Hernich, A. (2011) · Logical Methods in Computer Science · doi:10.2168/lmcs-7(3:9)2011 · Cited by 12
Computing certain answers in the presence of dependencies
Afrati, F., & Kiourtis, N. (2009) · Information Systems · doi:10.1016/j.is.2009.08.002 · Cited by 12
Optimizing the chase: scalable data integration under constraints
Konstantinidis, G., & Ambite, J. L. (2014) · Proceedings of the VLDB Endowment · doi:10.14778/2733085.2733093 · Cited by 12
Metadata
- Authors
- Fagin, R., Kolaitis, P. G., Miller, R. J., & Popa, L.
- Affiliations
- IBM Research - Almaden (US)
- University of California, Santa Cruz (US)
- University of Toronto (CA)
- Corresponding author
- Popa, Lucian
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2005-05
- Volume
- 336
- Issue
- 1
- Pages
- 89-124
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2102729564
- Cited by
- 1,206
- References
- 40
- Citations by year
- 2026: 5 · 2025: 13 · 2024: 10 · 2023: 41 · 2022: 32 · 2021: 32 · 2020: 53 · 2019: 59 · 2018: 57 · 2017: 69 · 2016: 58 · 2015: 63 · 2014: 80 · 2013: 101 · 2012: 95
- FWCI
- 51.62
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 3035 d)
- Locations
- Theoretical Computer Science (publishedVersion)
- Funders
- National Science Foundation (9907419)
- Natural Sciences and Engineering Research Council of Canada
- Topics
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Physical Sciences › Computer Science › Artificial Intelligence › Semantic Web and Ontologies
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Keywords
- data exchange, query answering, universal solutions, algebraic specification, certain answers, canonical solutions, computational complexity, schema mapping
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.