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 801–900 of 1,001
Disjunctive logic programs with existential quantification in rule heads
You, J.-H., Zhang, H., & Zhang, Y. (2013) · Theory and Practice of Logic Programming · doi:10.1017/s1471068413000355 · Cited by 3
Locality of Queries and Transformations
Libkin, L. O. (2005) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.04.041 · Cited by 3
A New Framework for Designing Schema Mappings
Alexe, B., & Tan, W.-C. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-41660-6_4 · Cited by 3
Flat Versus Hierarchical Information Models in PLM Standardization Frameworks
Krima, S., & Lubell, J. (2016) · IFIP advances in information and communication technology · doi:10.1007/978-3-319-54660-5_12 · Cited by 3
Reasoning about integrity constraints for tree-structured data
Czerwinski, W. K., David, C., Murlak, F., & Parys, P. (2017) · Theory of Computing Systems · doi:10.1007/s00224-017-9771-z · Cited by 3
Smart Space Applications Integration: A Mediation Formalism and Design for Smart-M3
Korolev, Y., Korzun, D. G., & Galov, I. V. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32686-8_12 · Cited by 3
How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)?
Benedikt, M. (2018) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/3196959.3196989 · Cited by 3
Towards a Benchmark for Knowledge Base Exchange.
Bashardoost, B. G., Miller, R. J., & Lyons, K. A. (2019) · Knowledge Discovery and Data Mining · Cited by 3
Self-citationBalancing Expressiveness and Inexpressiveness in View Design
Benedikt, M., Bourhis, P., Jachiet, L., & Tsamoura, E. (2020) · ACM Transactions on Database Systems · doi:10.1145/3488370 · Cited by 3
Gries, J., Eickhoff, T., Eiden, A., & Göbel, J. C. (2020) · IFIP advances in information and communication technology · doi:10.1007/978-3-030-62807-9_20 · Cited by 3
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations
Lanzinger, M., Sferrazza, S., & Gottlob, G. (2022) · Theory and Practice of Logic Programming · doi:10.1017/s1471068422000199 · Cited by 3
Formalization of Data Integration Transformations
Abgrall, T. (2022) · Communications in computer and information science · doi:10.1007/978-3-031-15743-1_56 · Cited by 3
RDFS(c) Schema Inconsistency Checking Based on a Key Instance and Its Query Rewriting
Zhao, X., Li, F., & Yang, H. (2023) · IEEE Access · doi:10.1109/access.2023.3234084 · Cited by 3
Uniform Restricted Chase Termination
Gogacz, T., Marcinkowski, J., & Pieris, A. (2023) · SIAM Journal on Computing · doi:10.1137/20m1377035 · Cited by 3
General Acyclicity and Cyclicity Notions for the Disjunctive Skolem Chase
Gerlach, L., & Carral, D. (2023) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v37i5.25784 · Cited by 3
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/– under Preferred Repairs
Lukasiewicz, T., Malizia, E., & Molinaro, C. (2023) · Principles of Knowledge Representation and Reasoning · doi:10.24963/kr.2023/46 · Cited by 3
Query Rewriting under Ontology Contraction
Tsalapati, E., Stoilos, G., Stamou, G. B., & Koletsos, G. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33203-6_13 · Cited by 3
Inter Model Data Exchange of Type Information via a Common Type Hierarchy.
Smith, A. C., & McBrien, P. (2006) · Cited by 3
Approximate Queries on Big Heterogeneous Data
Kantere, V. (2015) · IEEE International Congress on Big Data (BigData Congress) · doi:10.1109/bigdatacongress.2015.115 · Cited by 3
A visual XML dataspace approach for satisfying ad hoc information needs
Moilanen, K., Niemi, T., Näppilä, T., & Kuru, M. (2015) · Journal of the Association for Information Science and Technology · doi:10.1002/asi.23326 · Cited by 3
Information retrieval for probabilistic pattern matching based on neural network
Sun, Y., Lin, X., Jia, Q., Liu, X., & Chen, F. (2012) · International Conference on Systems and Informatics (ICSAI) · doi:10.1109/icsai.2012.6223592 · Cited by 3
Semantic Schema Mapping Using Property Precedence Relations
Sekhavat, Y. A., & Parsons, J. (2012) · IEEE International Conference on Semantic Computing (ICSC) · doi:10.1109/icsc.2012.24 · Cited by 3
High-Level Rules for Integration and Analysis of Data: New Challenges
Alexe, B., Burdick, D., Hernández, M. A., Koutrika, G., Krishnamurthy, R., Popa, L. C., Stanoi, I., & Wisnesky, R. J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-41660-6_3 · Cited by 3
Self-citationEfficient derivation of numerical dependencies
Ciaccia, P., Golfarelli, M., & Rizzi, S. (2012) · Information Systems · doi:10.1016/j.is.2012.07.007 · Cited by 3
Rewrite and Conquer: Dealing with Integrity Constraints in Data Integration
Calì, A., Calvanese, D., Giacomo, G. D., & Maurizio Lenzerini, B. (2013) · Springer eBooks · doi:10.1007/978-3-642-36926-1_28 · Cited by 3
Datalog as a Query Language for Data Exchange Systems
Arenas, M., Barceló, P., & Reutter, J. L. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24206-9_18 · Cited by 3
Horne, R., & Vladimiro Sassone, C. (2011) · ePrints Soton (University of Southampton) · Cited by 3
Roth, A., & Skritek, S. (2013) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/dfu.vol5.10452.185 · Cited by 3
Datalog Relaunched: Simulation Unification and Value Invention
Bry, F., Furche, T., Ley, C., Marnette, B., Linse, B., & Schaffert, S. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24206-9_19 · Cited by 3
oMAP: An Implemented Framework for Automatically Aligning OWL Ontologies.
Straccia, U., & Raphaël Troncy, A. (2005) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 3
Schema Transformations and Query Rewriting in Ontological Databases with a Faceted Interface
Pankowski, T. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-93317-7_3 · Cited by 3
Evaluating User Behaviour in a Cooperative Environment
Bazzi, E., Cassavia, N., Chiggiato, D., Masciari, E., Saccà, D., Spada, A., & Trubitsyna, I. (2018) · Information · doi:10.3390/info9120303 · Cited by 3
Borgwardt, S., & Forkel, W. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-19570-0_24 · Cited by 3
Too Much Information: Can AI Cope with Modern Knowledge Graphs?
Krötzsch, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-21462-3_2 · Cited by 3
Efficient Datalog Rewriting for Query Answering in TGD Ontologies
Wang, Z., Xiao, P., Wang, K., Zhuang, Z., & Wan, H. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3111011 · Cited by 3
Characterizing the Program Expressive Power of Existential Rule Languages
Zhang, H., & Jiang, G. (2022) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v36i5.20540 · Cited by 3
D2.2.4: Alignment implementation and benchmarking results
Stuckenschmidt, H., Euzenat, J., Heß, A., van Hage, W. R., Hu, W. P., Jian, N., Cheng, G., Qu, Y., Stoilos, G., Svátek, V., et al. (2006) · Cited by 3
Stop the Chase: Short Contribution.
Meier, M., Schmidt, M., & Lausen, G. (2009) · Cited by 3
Deep Separability of Ontological ConstraintsPreprint
Calì, A., Console, M., & Frosini, R. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1312.5914 · Cited by 3
Approximate schemas, source-consistency and query answering
de Rougemont, M., & Vieilleribière, A. (2008) · Journal of Intelligent Information Systems · doi:10.1007/s10844-008-0060-9 · Cited by 3
FleDEx: flexible data exchange
Mesquita, F., Barbosa, D., Cortez, E., & da Silva, A. S. (2007) · ACM International Workshop on Web Information and Data Management (WIDM) · doi:10.1145/1316902.1316907 · Cited by 3
Crowdsourced, Actionable and Verifiable Contextual Informational NormsPreprint
Shvartzshnaider, Y., Tong, S., Wies, T., Kift, P., Nissenbaum, H. F., Subramanian, L., & Mittal, P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1601.04740 · Cited by 3
Abstract Structure of Data Communication in IoT Application
Lu, H., Shu, F., Min, L., & Wang, Y. (2018) · IEEE International Conference on Computer and Communications (ICCC) · doi:10.1109/compcomm.2018.8780910 · Cited by 3
Decision Procedures for Guarded LogicsPreprint
Kappelmann, K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.03679 · Cited by 3
Distribution Constraints: The Chase for Distributed DataPreprint
Geck, G., Neven, F., & Schwentick, T. (2020) · arXiv (Cornell University) · doi:10.4230/lipics.icdt.2020.13 · Cited by 3
Adapting Mappings in Frequently Changing Environments
Velegrakis, Y., Miller, R. J., & Popa, L. C. (n.d.) · Cited by 3
Self-citationBarceló, P., Fontaine, G., Salvati, S., & Tison, S. (2025) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2025.103694 · Cited by 3
Extending Relational Algebra to express one-to-many data transformations.
Carreira, P., Galhardas, H., Lopes, A., & Pereira, J. D. (2005) · Cited by 3
Answering Queries with Negation over Existential Rules
Ellmauthaler, S., Krötzsch, M., & Mennicke, S. (2022) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v36i5.20503 · Cited by 2
Checking Chase Termination over Ontologies of Existential Rules with Equality
Carral, D., & Urbani, J. (2020) · AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) · doi:10.1609/aaai.v34i03.5663 · Cited by 2
A Web service based integration model of data-providing sources
Masud, M., & Rouached, M. (2013) · International Conference on Digital Information Management · doi:10.1109/icdim.2013.6693974 · Cited by 2
Complexity of conjunctive query answering under access limitations (preliminary report)
Calì, A., & Razgon, I. (2014) · BIROn (Birkbeck, University of London) · Cited by 2
Exchange-Repairs: Managing Inconsistency in Data Exchange
ten Cate, B., Halpert, R., & Kolaitis, P. G. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11113-1_10 · Cited by 2
Self-citationUnique Solutions in Data Exchange
Ngo, N., & Franconi, E. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-10085-2_26 · Cited by 2
Data exchange for document-centric XML
Sherkhonov, E. (2014) · doi:10.1145/2602622.2602628 · Cited by 2
Semantic Legal Policies for Data Exchange and Protection across Super-Peer Domains in the Cloud
Hu, Y.-J., Wu, W.-N., Cheng, K.-P., & Huang, Y.-L. (2012) · Future Internet · doi:10.3390/fi4040929 · Cited by 2
Query Reformulation in PDMS Based on Social Relevance
Bonifati, A., Summa, G., Pacitti, E., & Draidi, F. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-45942-3_3 · Cited by 2
Rewriting-based Check of Chase Termination
Calautti, M., Greco, S., Molinaro, C., & Trubitsyna, I. (2015) · Institutional Research Information System (Università degli Studi di Trento) · Cited by 2
Analyzing Uncertain Tabular Data
Kennedy, O. A., & Glavic, B. (2019) · Information fusion and data science · doi:10.1007/978-3-030-03643-0_12 · Cited by 2
Transforming RDF Data into Property Graphs
Angles, R., & García, R. (2020) · IEEE Latin America Transactions · doi:10.1109/tla.2020.9049470 · Cited by 2
Sticky Existential Rules and Disjunction are Incompatible
Morak, M. (2021) · Principles of Knowledge Representation and Reasoning · doi:10.24963/kr.2021/71 · Cited by 2
Ontological databases with faceted queries
Pankowski, T. (2022) · The VLDB Journal · doi:10.1007/s00778-022-00735-3 · Cited by 2
Lyon, T. S., & Ostropolski-Nalewaja, P. (2023) · Principles of Knowledge Representation and Reasoning · doi:10.24963/kr.2023/79 · Cited by 2
Ontology-Based Schema-Level Data Quality: The Case of Consistency
Cima, G., Console, M., & Maurizio Lenzerini, B. (2025) · Journal of Data and Information Quality · doi:10.1145/3770750 · Cited by 2
Semantic Geographic Space: From Big Data to Ecosystems of Data
Pileggi, S. F., & Amor, R. (2015) · Studies in big data · doi:10.1007/978-3-319-11056-1_12 · Cited by 2
Semantics Preservation in Schema Mappings within Data Exchange Systems
Pankowski, T. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37343-5_10 · Cited by 2
Data Integration for Systemic Risk in the Financial System
Rosenthal, A. S., & Seligman, L. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9781139151184.006 · Cited by 2
Schema Matching and Schema Merging based on Uncertain Semantic Mappings
Rizopoulos, N. (2010) · Cited by 2
Unique Solutions in Data Exchange under STS Mappings.
Ngo, N., & Franconi, E. (2016) · Open Research (University of Surrey) · Cited by 2
Principles of peer-to-peer data integration
Maurizio Lenzerini, B. (2004) · Cited by 2
Research on SLA information model based on SID
He, G., & Lu, Z. (2015) · International Conference on Computer Science & Education (ICCSE) · doi:10.1109/iccse.2015.7250396 · Cited by 2
Empowering Provenance in Data Integration
Kondylakis, H., Doerr, M., & Plexousakis, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03973-7_20 · Cited by 2
Queralt, A., Martí, J., Baars, H., Brinkmann, A., & Cortés, T. (2015) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.2015.565 · Cited by 2
Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules
Bourhis, P., Morak, M., & Pieris, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44522-8_9 · Cited by 2
Learning queries for relational, semi-structured, and graph databases
Ciucanu, R. (2013) · doi:10.1145/2483574.2483576 · Cited by 2
Propagating Dependencies under Schema Mappings: A Graph-based Approach
Wang, Q., & Wen, X. (2014) · International Database Engineering and Applications Symposium (IDEAS) · doi:10.1145/2790755.2790766 · Cited by 2
On a proposal to integrate web sources using semantic-web technologies
Sleiman, H. A., Rivero, C. R., & Corchuelo, R. (2011) · International Conference on Next Generation Web Services Practices · doi:10.1109/nwesp.2011.6088199 · Cited by 2
Study on consistent query answering in inconsistent databases
Xie, D., & Yang, L. (2007) · Frontiers of Computer Science in China · doi:10.1007/s11704-007-0048-6 · Cited by 2
Validation of schema mappings with nested queries
Rull, G., Farré, C., Teniente, E., & Urpí, T. (2012) · Computer Science and Information Systems · doi:10.2298/csis120713042r · Cited by 2
Perspectives on Business Intelligence
Ng, R. T., Arocena, P. C., Barbosa, D., Carenini, G., Gomes-Jr, L., Jou, S., Leung, R., Milios, E., Miller, R. J., Mylopoulos, J., et al. (2013) · Synthesis lectures on data management · doi:10.1007/978-3-031-01848-0 · Cited by 2
Self-citationKalinichenko, L. A. (2012) · Programming and Computer Software · doi:10.1134/s0361768812060059 · Cited by 2
Incompleteness in information integration
Kharlamov, E., & Nutt, W. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454242 · Cited by 2
Classifying Chemicals Using Description Graphs and Logic Programming
Magka, D., Motik, B., & Horrocks, I. R. (2012) · Cited by 2
Medina, J., & Pichler, R. (2015) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2015.12.004 · Cited by 2
Trees in Trees: Is the Incomplete Information about a Tree Consistent?
Kopczyński, E. (2011) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.csl.2011.367 · Cited by 2
Revisiting Acyclicity and Guardedness Criteria for Decidability of Existential Rules
Rudolph, S. (2011) · Cited by 2
Mapping and Cleaning: the LLUNATIC Way
Geerts, F., Mecca, G., Papotti, P., & Santoro, D. (2014) · Cited by 2
A Short History of Schema Mapping Systems
Mecca, G., Papotti, P., & Santoro, D. (2012) · CINECA IRIS Institutional Research Information System (University of Basilicata) · Cited by 2
Union and Intersection of Schema Mappings.
Pérez, J. E. P., Pichler, R., Sallinger, E., & Savenkov, V. (2012) · Cited by 2
Dealing with Inconsistency in Databases: An Overview
Calautti, M., Caroprese, L., Fazzinga, B., Flesca, S., Furfaro, F., Greco, S., Molinaro, C., Parisi, F., Pugliese, A., Saccà, D., et al. (2017) · Studies in big data · doi:10.1007/978-3-319-61893-7_9 · Cited by 2
On the Interaction of Inclusion Dependencies with Independence Atoms
Hannula, M., Kontinen, J., & Link, S. (2018) · EPiC series in computing · doi:10.29007/2pgn · Cited by 2
Schema Mappings: A Case of Logical Dynamics in Database Theory
ten Cate, B., & Kolaitis, P. G. (2014) · Outstanding contributions to logic · doi:10.1007/978-3-319-06025-5_3 · Cited by 2
Self-citationKnowledge Refinement via Rule Selection
Kolaitis, P. G., Popa, L. C., & Qian, K. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33012886 · Cited by 2
Self-citationAll-Instances Restricted Chase Termination
Gogacz, T., Marcinkowski, J., & Pieris, A. (2020) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/3375395.3387644 · Cited by 2
Explanation-Friendly Query Answering Under Uncertainty
Martínez, M. V., & Simari, G. I. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-31423-1_2 · Cited by 2
Answer Counting Under Guarded TGDs.
Feier, C., Lutz, C., & Przybyłko, M. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icdt.2021.11 · Cited by 2
Preserving Information Content in RDF Using Bounded Homomorphisms
Stolpe, A., & Skjæveland, M. G. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30284-8_12 · Cited by 2
Benedikt, M., & Senellart, P. P. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1168-0_10 · Cited by 2
Separability and Its Approximations in Ontology-based Data Management
Cima, G., Croce, F., & Maurizio Lenzerini, B. (2023) · Semantic Web · doi:10.3233/sw-233391 · Cited by 2
Query Rewriting with Disjunctive Existential Rules and Mappings
Leclère, M., Mugnier, M.-L., & Pérution-Kihli, G. (2023) · Principles of Knowledge Representation and Reasoning · doi:10.24963/kr.2023/42 · Cited by 2
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.