Egor V. Kostylev : Publications
Journal papers
-
[1]
Limit Datalog: A declarative query language for data analysis
Bernardo Cuenca Grau‚ Ian Horrocks‚ Mark Kaminski‚ Egor V. Kostylev and Boris Motik
In ACM SIGMOD Record (SIGMOD Rec.). 2019.
Details about Limit Datalog: A declarative query language for data analysis | BibTeX data for Limit Datalog: A declarative query language for data analysis
-
[2]
Logical foundations of linked data anonymisation
Bernardo Cuenca Grau and Egor V. Kostylev
In Journal of Artificial Intelligence Research (JAIR). Vol. 64. Pages 253–314. 2019.
Details about Logical foundations of linked data anonymisation | BibTeX data for Logical foundations of linked data anonymisation
-
[3]
Foundations of ontology−based data access under bag semantics
Charalampos Nikolaou‚ Egor V. Kostylev‚ George Konstantinidis‚ Mark Kaminski‚ Bernardo Cuenca Grau and Ian Horrocks
In Artificial Intelligence (AIJ). Vol. 274. Pages 91–132. 2019.
Details about Foundations of ontology−based data access under bag semantics | BibTeX data for Foundations of ontology−based data access under bag semantics
-
[4]
Complexity and expressive power of weakly well−designed SPARQL
Mark Kaminski and Egor V. Kostylev
In Theory of Computing Systems (ToCS). Vol. 62. No. 4. Pages 772–809. 2018.
Details about Complexity and expressive power of weakly well−designed SPARQL | BibTeX data for Complexity and expressive power of weakly well−designed SPARQL
-
[5]
Containment of queries for graphs with data
Egor V. Kostylev‚ Juan L. Reutter and Domagoj Vrgoc
In Journal of Computer and System Sciences (JCSS). Vol. 92. Pages 65–91. 2018.
Details about Containment of queries for graphs with data | BibTeX data for Containment of queries for graphs with data
-
[6]
Logical foundations of information disclosure in ontology−based data integration
Michael Benedikt‚ Bernardo Cuenca Grau and Egor V. Kostylev
In Artificial Intelligence (AIJ). Vol. 262. Pages 52–95. 2018.
Details about Logical foundations of information disclosure in ontology−based data integration | BibTeX data for Logical foundations of information disclosure in ontology−based data integration
-
[7]
Query nesting‚ assignment‚ and aggregation in SPARQL 1.1
Mark Kaminski‚ Egor V. Kostylev and Bernardo Cuenca Grau
In ACM Transactions on Database Systems (TODS). Vol. 42. No. 3. Pages 17:1–17:46. 2017.
Details about Query nesting‚ assignment‚ and aggregation in SPARQL 1.1 | BibTeX data for Query nesting‚ assignment‚ and aggregation in SPARQL 1.1
-
[8]
Static analysis of navigational XPath over graph databases
Egor V. Kostylev‚ Juan L. Reutter and Domagoj Vrgoc
In Information Processing Letters (IPL). Vol. 116. No. 7. Pages 467–474. 2016.
Details about Static analysis of navigational XPath over graph databases | BibTeX data for Static analysis of navigational XPath over graph databases
-
[9]
Complexity of answering counting aggregate queries over DL−Lite
Egor V. Kostylev and Juan L. Reutter
In Journal of Web Semantics: Science‚ Services and Agents on the World Wide Web (JWS). Vol. 33. No. 1. Pages 94–111. 2015.
Details about Complexity of answering counting aggregate queries over DL−Lite | BibTeX data for Complexity of answering counting aggregate queries over DL−Lite
-
[10]
Queries with negation and inequalities over lightweight ontologies
Víctor Gutiérrez−Basulto‚ Yazmin Angélica Ibáñez−García‚ Roman Kontchakov and Egor V. Kostylev
In Journal of Web Semantics: Science‚ Services and Agents on the World Wide Web (JWS). Vol. 35. No. 4. Pages 184–202. 2015.
Details about Queries with negation and inequalities over lightweight ontologies | BibTeX data for Queries with negation and inequalities over lightweight ontologies
-
[11]
Classification of annotation semirings over containment of conjunctive queries
Egor V. Kostylev‚ Juan L. Reutter and András Z. Salamon
In ACM Transactions on Database Systems (TODS). Vol. 39. No. 1. Pages 1:1–1:39. 2014.
Details about Classification of annotation semirings over containment of conjunctive queries | BibTeX data for Classification of annotation semirings over containment of conjunctive queries
-
[12]
On complexity of the anti−unification problem
Egor V. Kostylev and Vladimir A. Zakharov
In Discrete Mathematics and Applications. Vol. 18. No. 1. Pages 85–98. 2008.
Details about On complexity of the anti−unification problem | BibTeX data for On complexity of the anti−unification problem
-
[13]
On the generalization of substitutions as applied to program static analysis problem
Egor V. Kostylev and Vladimir A. Zakharov
In Moscow University Computational Mathematics and Cybernetics. Vol. 29. No. 4. Pages 42–49. 2005.
Details about On the generalization of substitutions as applied to program static analysis problem | BibTeX data for On the generalization of substitutions as applied to program static analysis problem
Conference papers
-
[1]
Complexity and expressive power of disjunction and negation in limit Datalog
Mark Kaminski‚ Bernardo Cuenca Grau‚ Egor V. Kostylev and Ian Horrocks
In Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020)‚ New York‚ New York‚ USA‚ February 9–12‚ 2020. 2020.
Details about Complexity and expressive power of disjunction and negation in limit Datalog | BibTeX data for Complexity and expressive power of disjunction and negation in limit Datalog
-
[2]
The logical expressiveness of graph neural networks
Pablo Barceló‚ Egor V. Kostylev‚ Mikael Monet‚ Jorge Pérez‚ Juan Reutter and Juan Pablo Silva
In Proceedings of the 8th International Conference on Learning Representations (ICLR 2020)‚ Addis Ababa‚ Ethopia‚ April 26–30‚ 2020. 2020.
Details about The logical expressiveness of graph neural networks | BibTeX data for The logical expressiveness of graph neural networks
-
[3]
Towards explainable entity matching via comparison queries
Alina Petrova‚ Egor V. Kostylev‚ Bernardo Cuenca Grau and Ian Horrocks
In Proceedings of the 14th International Workshop on Ontology Matching co−located with the 18th International Semantic Web Conference (OM@ISWC 2019)‚ Auckland‚ New Zealand‚ October 26‚ 2019. 2019.
Details about Towards explainable entity matching via comparison queries | BibTeX data for Towards explainable entity matching via comparison queries
-
[4]
Bagging the DL−Lite family further
Gianluca Cima‚ Charalampos Nikolaou‚ Egor V. Kostylev‚ Mark Kaminski‚ Bernardo Cuenca Grau and Ian Horrocks
In Proceedings of the 32nd International Workshop on Description Logics (DL 2019)‚ Oslo‚ Norway‚ June 18–21‚ 2019. Vol. 2373 of CEUR Workshop Proceedings. CEUR−WS.org. 2019.
Details about Bagging the DL−Lite family further | BibTeX data for Bagging the DL−Lite family further
-
[5]
Satisfaction and implication of integrity constraints in ontology−based data access
Charalampos Nikolaou‚ Bernardo Cuenca Grau‚ Egor V. Kostylev‚ Mark Kaminski and Ian Horrocks
In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI 2019)‚ Macao‚ China‚ August 10–16‚ 2019. Pages 1829–1835. ijcai.org. 2019.
Details about Satisfaction and implication of integrity constraints in ontology−based data access | BibTeX data for Satisfaction and implication of integrity constraints in ontology−based data access
-
[6]
DatalogMTL: computational complexity and expressive power
Przemysław A. Wał̧̧ega‚ Bernardo Cuenca Grau‚ Mark Kaminski and Egor V. Kostylev
In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI 2019)‚ Macao‚ China‚ August 10–16‚ 2019. Pages 1886–1892. ijcai.org. 2019.
Details about DatalogMTL: computational complexity and expressive power | BibTeX data for DatalogMTL: computational complexity and expressive power
-
[7]
Bag semantics of DL−Lite with functional axioms
Gianluca Cima‚ Charalampos Nikolaou‚ Egor V. Kostylev‚ Mark Kaminski‚ Bernardo Cuenca Grau and Ian Horrocks
In Proceedings of the 18th International Semantic Web Conference (ISWC 2019)‚ Auckland‚ New Zealand‚ October 26–30‚ 2019. Vol. 11778 of Lecture Notes in Computer Science. Pages 128–144. Springer‚ Cham. 2019.
Details about Bag semantics of DL−Lite with functional axioms | BibTeX data for Bag semantics of DL−Lite with functional axioms
-
[8]
Query−based entity comparison in knowledge graphs revisited
Alina Petrova‚ Egor V. Kostylev‚ Bernardo Cuenca Grau and Ian Horrocks
In Proceedings of the 18th International Semantic Web Conference (ISWC 2019)‚ Auckland‚ New Zealand‚ October 26–30‚ 2019. Vol. 11778 of Lecture Notes in Computer Science. Pages 558–575. Springer‚ Cham. 2019.
Details about Query−based entity comparison in knowledge graphs revisited | BibTeX data for Query−based entity comparison in knowledge graphs revisited
-
[9]
Estimating the cardinality of conjunctive queries over RDF data using graph summarisation
Giorgio Stefanoni‚ Boris Motik and Egor V. Kostylev
In Proceedings of the Web Conference 2018 (TheWebConf 2018‚ formerly known as World Wide Web Conference‚ WWW)‚ Lyon‚ France‚ April 23−27‚ 2018. Pages 1043–1052. ACM. 2018.
Details about Estimating the cardinality of conjunctive queries over RDF data using graph summarisation | BibTeX data for Estimating the cardinality of conjunctive queries over RDF data using graph summarisation
-
[10]
Stratified negation in limit Datalog programs
Mark Kaminski‚ Bernardo Cuenca Grau‚ Egor V. Kostylev‚ Boris Motik and Ian Horrocks
In Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI 2018)‚ Stockholm‚ Sweden‚ July 13−19‚ 2018. Pages 1875–1881. ijcai.org. 2018.
Details about Stratified negation in limit Datalog programs | BibTeX data for Stratified negation in limit Datalog programs
-
[11]
Source information disclosure in ontology−based data integration
Michael Benedikt‚ Bernardo Cuenca Grau and Egor V. Kostylev
In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017)‚ San Francisco‚ California‚ USA‚ February 4−9‚ 2017. Pages 1056–1062. AAAI Press. 2017.
Details about Source information disclosure in ontology−based data integration | BibTeX data for Source information disclosure in ontology−based data integration
-
[12]
A note on computing certain answers to queries over incomplete databases
Marcelo Arenas‚ Elena Botoeva‚ Egor V. Kostylev and Vladislav Ryzhikov
In Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web (AMW 2017)‚ Montevideo‚ Uruguay‚ June 7−9‚ 2017. Vol. 1912 of CEUR Workshop Proceedings. CEUR−WS.org. 2017.
Details about A note on computing certain answers to queries over incomplete databases | BibTeX data for A note on computing certain answers to queries over incomplete databases
-
[13]
Reformulating queries: theory and practice
Michael Benedikt‚ Egor V. Kostylev‚ Fabio Mogavero and Efthymia Tsamoura
In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017)‚ Melbourne‚ Victoria‚ Australia‚ August 19−25‚ 2017. Pages 837–843. ijcai.org. 2017.
Details about Reformulating queries: theory and practice | BibTeX data for Reformulating queries: theory and practice
-
[14]
Foundations of declarative data analysis using limit Datalog programs
Mark Kaminski‚ Bernardo Cuenca Grau‚ Egor V. Kostylev‚ Boris Motik and Ian Horrocks
In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017)‚ Melbourne‚ Victoria‚ Australia‚ August 19−25‚ 2017. Pages 1123–1130. ijcai.org. 2017.
Details about Foundations of declarative data analysis using limit Datalog programs | BibTeX data for Foundations of declarative data analysis using limit Datalog programs
-
[15]
The bag semantics of ontology−based data access
Charalampos Nikolaou‚ Egor V. Kostylev‚ George Konstantinidis‚ Mark Kaminski‚ Bernardo Cuenca Grau and Ian Horrocks
In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017)‚ Melbourne‚ Victoria‚ Australia‚ August 19−25‚ 2017. Pages 1224–1230. ijcai.org. 2017.
Details about The bag semantics of ontology−based data access | BibTeX data for The bag semantics of ontology−based data access
-
[16]
Semantic faceted search with aggregation and recursion
Evgeny Sherkhonov‚ Bernardo Cuenca Grau‚ Evgeny Kharlamov and Egor V. Kostylev
In Proceedings of the 16th International Semantic Web Conference (ISWC 2017)‚ Vienna‚ Austria‚ October 21−25‚ 2017‚ Part I. Vol. 10587 of Lecture Notes in Computer Science. Pages 594–610. Springer. 2017.
Details about Semantic faceted search with aggregation and recursion | BibTeX data for Semantic faceted search with aggregation and recursion
-
[17]
Ranking‚ aggregation‚ and reachability in faceted search with SemFacet
Evgeny Kharlamov‚ Luca Giacomelli‚ Evgeny Sherkhonov‚ Bernardo Cuenca Grau‚ Egor V. Kostylev and Ian Horrocks
In Proceedings of the ISWC 2017 Posters & Demonstrations and Industry Tracks (ISWC−PD−Industry 2017) co−located with the 16th International Semantic Web Conference (ISWC 2017)‚ Vienna‚ Austria‚ October 23−25‚ 2017. Vol. 1963 of CEUR Workshop Proceedings. CEUR−WS.org. 2017.
Details about Ranking‚ aggregation‚ and reachability in faceted search with SemFacet | BibTeX data for Ranking‚ aggregation‚ and reachability in faceted search with SemFacet
-
[18]
SemFacet: making hard faceted search easier
Evgeny Kharlamov‚ Luca Giacomelli‚ Evgeny Sherkhonov‚ Bernardo Cuenca Grau‚ Egor V. levKosty and Ian Horrocks
In Proceedings of the 26th International Conference on Information and Knowledge Management (CIKM 2017)‚ Singapore‚ November 6−10‚ 2017. Pages 2475–2478. ACM. 2017.
Details about SemFacet: making hard faceted search easier | BibTeX data for SemFacet: making hard faceted search easier
-
[19]
Logical foundations of privacy−preserving publishing of Linked Data
Bernardo Cuenca Grau and Egor V. Kostylev
In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI 2016)‚ Phoenix‚ Arizona‚ USA‚ February 12−17‚ 2016. Pages 943–949. AAAI Press. 2016.
Details about Logical foundations of privacy−preserving publishing of Linked Data | BibTeX data for Logical foundations of privacy−preserving publishing of Linked Data
-
[20]
Beyond well−designed SPARQL
Mark Kaminski and Egor V. Kostylev
In Proceedings of the 19th International Conference on Database Theory (ICDT 2016)‚ Bordeaux‚ France‚ March 15−18‚ 2016. Vol. 48 of LIPIcs. Pages 5:1–5:18. Schloss Dagstuhl – Leibniz−Zentrum für Informatik. 2016.
Details about Beyond well−designed SPARQL | BibTeX data for Beyond well−designed SPARQL
-
[21]
Semantics and expressive power of subqueries and aggregates in SPARQL 1.1
Mark Kaminski‚ Egor V. Kostylev and Bernardo Cuenca Grau
In Proceedings of the 25th International Conference on World Wide Web (WWW 2016)‚ Montreal‚ Canada‚ April 11−15‚ 2016. Pages 227–238. ACM. 2016.
Details about Semantics and expressive power of subqueries and aggregates in SPARQL 1.1 | BibTeX data for Semantics and expressive power of subqueries and aggregates in SPARQL 1.1
-
[22]
Reverse engineering SPARQL queries
Marcelo Arenas‚ Gonzalo I. Diaz and Egor V. Kostylev
In Proceedings of the 25th International Conference on World Wide Web (WWW 2016)‚ Montreal‚ Canada‚ April 11−15‚ 2016. Pages 239–249. ACM. 2016.
Details about Reverse engineering SPARQL queries | BibTeX data for Reverse engineering SPARQL queries
-
[23]
On expressibility of non−monotone operators in SPARQL
Roman Kontchakov and Egor V. Kostylev
In Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016)‚ Cape Town‚ South Africa‚ April 25−29‚ 2016. Pages 369–379. AAAI Press. 2016.
Details about On expressibility of non−monotone operators in SPARQL | BibTeX data for On expressibility of non−monotone operators in SPARQL
-
[24]
Nested constructs vs. sub−selects in SPARQL
Axel Polleres‚ Juan L. Reutter and Egor V. Kostylev
In Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2016)‚ Panama City‚ Panama‚ May 8−10‚ 2016. Vol. 1644 of CEUR Workshop Proceedings. CEUR−WS.org. 2016.
Details about Nested constructs vs. sub−selects in SPARQL | BibTeX data for Nested constructs vs. sub−selects in SPARQL
-
[25]
XPath for DL ontologies
Egor V. Kostylev‚ Juan L. Reutter and Domagoj Vrgoc
In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015)‚ Austin‚ Texas‚ USA‚ January 25−30‚ 2015. Pages 1525–1531. AAAI Press. 2015.
Details about XPath for DL ontologies | BibTeX data for XPath for DL ontologies
-
[26]
CONSTRUCT queries in SPARQL
Egor V. Kostylev‚ Juan L. Reutter and Martín Ugarte
In Proceedings of the 18th International Conference on Database Theory (ICDT 2015)‚ Brussels‚ Belgium‚ March 23−27‚ 2015. Vol. 31 of LIPIcs. Pages 212–229. Schloss Dagstuhl – Leibniz−Zentrum für Informatik. 2015.
Details about CONSTRUCT queries in SPARQL | BibTeX data for CONSTRUCT queries in SPARQL
-
[27]
Semantics of SPARQL under OWL 2 entailment regimes
Egor V. Kostylev and Bernardo Cuenca Grau
In Informal Proceedings of the 28th International Workshop on Description Logics (DL 2015)‚ Athens‚ Greece‚ June 7−10‚ 2015. Vol. 1350 of CEUR Workshop Proceedings. CEUR−WS.org. 2015.
Details about Semantics of SPARQL under OWL 2 entailment regimes | BibTeX data for Semantics of SPARQL under OWL 2 entailment regimes
-
[28]
Controlled query evaluation for Datalog and OWL 2 profile ontologies
Bernardo Cuenca Grau‚ Evgeny Kharlamov‚ Egor V. Kostylev and Dmitriy Zheleznyakov
In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015)‚ Buenos Aires‚ Argentina‚ July 25−31‚ 2015. Pages 2883–2889. AAAI Press. 2015.
Details about Controlled query evaluation for Datalog and OWL 2 profile ontologies | BibTeX data for Controlled query evaluation for Datalog and OWL 2 profile ontologies
-
[29]
SPARQL with property paths
Egor V. Kostylev‚ Juan L. Reutter‚ Miguel Romero and Domagoj Vrgoc
In Proceedings of the 14th International Semantic Web Conference (ISWC 2015)‚ Bethlehem‚ Pennsylvania‚ USA‚ October 11−15‚ 2015‚ Part I. Vol. 9366 of Lecture Notes in Computer Science. Pages 3–18. Springer. 2015.
Details about SPARQL with property paths | BibTeX data for SPARQL with property paths
-
[30]
Containment of data graph queries
Egor V. Kostylev‚ Juan L. Reutter and Domagoj Vrgoc
In Proceedings of the 17th International Conference on Database Theory (ICDT 2014)‚ Athens‚ Greece‚ March 24−28‚ 2014. Pages 131–142. OpenProceedings.org. 2014.
Details about Containment of data graph queries | BibTeX data for Containment of data graph queries
-
[31]
Controlled query evaluation over lightweight ontologies
Bernardo Cuenca Grau‚ Evgeny Kharlamov‚ Egor V. Kostylev and Dmitriy Zheleznyakov
In Informal Proceedings of the 27th International Workshop on Description Logics (DL 2014)‚ Vienna‚ Austria‚ July 17−20‚ 2014. Vol. 1193 of CEUR Workshop Proceedings. Pages 141–152. CEUR−WS.org. 2014.
Details about Controlled query evaluation over lightweight ontologies | BibTeX data for Controlled query evaluation over lightweight ontologies
-
[32]
XPath for DL−Lite ontologies
Egor V. Kostylev‚ Juan L. Reutter and Domagoj Vrgoc
In Informal Proceedings of the 27th International Workshop on Description Logics (DL 2014)‚ Vienna‚ Austria‚ July 17−20‚ 2014. Vol. 1193 of CEUR Workshop Proceedings. Pages 258–269. CEUR−WS.org. 2014.
Details about XPath for DL−Lite ontologies | BibTeX data for XPath for DL−Lite ontologies
-
[33]
On the semantics of SPARQL queries with optional matching under entailment regimes
Egor V. Kostylev and Bernardo Cuenca Grau
In Proceedings of the 13th International Semantic Web Conference (ISWC 2014)‚ Riva del Garda‚ Italy‚ October 19−23‚ 2014‚ Part II. Vol. 8797 of Lecture Notes in Computer Science. Pages 374–389. Springer. 2014.
Details about On the semantics of SPARQL queries with optional matching under entailment regimes | BibTeX data for On the semantics of SPARQL queries with optional matching under entailment regimes
-
[34]
Annotations are relative
Peter Buneman‚ Egor V. Kostylev and Stijn Vansummeren
In Proceedings of the 16th International Conference on Database Theory (ICDT 2013)‚ Genoa‚ Italy‚ March 18−22‚ 2013. Pages 177–188. ACM. 2013.
Details about Annotations are relative | BibTeX data for Annotations are relative
-
[35]
Answering counting aggregate queries over ontologies of the DL−Lite family
Egor V. Kostylev and Juan L. Reutter
In Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI 2013)‚ Bellevue‚ Washington‚ USA‚ July 14−18‚ 2013. Pages 534–540. AAAI Press. 2013.
Details about Answering counting aggregate queries over ontologies of the DL−Lite family | BibTeX data for Answering counting aggregate queries over ontologies of the DL−Lite family
-
[36]
Complexity of answering counting aggregate queries over DL−Lite
Egor V. Kostylev and Juan L. Reutter
In Informal Proceedings of the 26th International Workshop on Description Logics (DL 2013)‚ Ulm‚ Germany‚ July 23−26‚ 2013. Vol. 1014 of CEUR Workshop Proceedings. Pages 364–376. CEUR−WS.org. 2013.
Details about Complexity of answering counting aggregate queries over DL−Lite | BibTeX data for Complexity of answering counting aggregate queries over DL−Lite
-
[37]
Conjunctive queries with negation over DL−Lite: a closer look
Víctor Gutiérrez−Basulto‚ Yazmin Angélica Ibáñez−García‚ Roman Kontchakov and Egor V. leKostyv
In Proceedings of the 7th International Conference on Web Reasoning and Rule Systems (RR 2013)‚ Mannheim‚ Germany‚ July 27−29‚ 2013. Pages 109–122. Springer. 2013.
Details about Conjunctive queries with negation over DL−Lite: a closer look | BibTeX data for Conjunctive queries with negation over DL−Lite: a closer look
-
[38]
Controlled query evaluation over OWL 2 RL ontologies
Bernardo Cuenca Grau‚ Evgeny Kharlamov‚ Egor V. Kostylev and Dmitriy Zheleznyakov
In Proceedings of the 12th International Semantic Web Conference (ISWC 2013)‚ Sydney‚ New South Wales‚ Australia‚ October 21−25‚ 2013‚ Part I. Vol. 8218 of Lecture Notes in Computer Science. Pages 49–65. Springer. 2013.
Details about Controlled query evaluation over OWL 2 RL ontologies | BibTeX data for Controlled query evaluation over OWL 2 RL ontologies
-
[39]
Combining dependent annotations for relational algebra
Egor V. Kostylev and Peter Buneman
In Proceedings of the 15th International Conference on Database Theory (ICDT 2012)‚ Berlin‚ Germany‚ March 26−29‚ 2012. Pages 196–207. ACM. 2012.
Details about Combining dependent annotations for relational algebra | BibTeX data for Combining dependent annotations for relational algebra
-
[40]
Classification of annotation semirings over query containment
Egor V. Kostylev‚ Juan L. Reutter and András Z. Salamon
In Proceedings of the 31st ACM SIGMOD−SIGACT−SIGART Symposium on Principles of Database Systems (PODS 2012)‚ Scottsdale‚ Arizona‚ USA‚ May 20−24‚ 2012. Pages 237–248. ACM. 2012.
Details about Classification of annotation semirings over query containment | BibTeX data for Classification of annotation semirings over query containment
-
[41]
Hierarchical models of provenance
Peter Buneman‚ James Cheney and Egor V. Kostylev
In Proceedings of the 4th USENIX Workshop on the Theory and Practice of Provenance (TaPP 2012)‚ Boston‚ Massachusetts‚ USA‚ June 14−15‚ 2012. USENIX Association. 2012.
Details about Hierarchical models of provenance | BibTeX data for Hierarchical models of provenance
-
[42]
Anti−unification algorithms and their applications in program analysis
Peter E. Bulychev‚ Egor V. Kostylev and Vladimir A. Zakharov
In Proceedings of the 7th International Andrei Ershov Memorial Conference on Perspectives of Systems Informatics (PSI 2009)‚ Novosibirsk‚ Russia‚ June 15−19‚ 2009‚ Revised Papers. Vol. 5947 of Lecture Notes in Computer Science. Pages 413–423. Springer. 2010.
Details about Anti−unification algorithms and their applications in program analysis | BibTeX data for Anti−unification algorithms and their applications in program analysis
-
[43]
Annotation algebras for RDFS
Peter Buneman and Egor V. Kostylev
In Proceedings of the 2nd International Workshop on the Role of Semantic Web in Provenance Management (SWPM 2010)‚ Shanghai‚ China‚ November 7‚ 2010. Vol. 670 of CEUR Workshop Proceedings. CEUR−WS.org. 2010.
Details about Annotation algebras for RDFS | BibTeX data for Annotation algebras for RDFS
Miscellaneous
-
[1]
Subsumption of weakly well−designed SPARQL patterns is undecidable
Mark Kaminski and Egor V. Kostylev
2019.
Details about Subsumption of weakly well−designed SPARQL patterns is undecidable | BibTeX data for Subsumption of weakly well−designed SPARQL patterns is undecidable
-
[2]
A note on the hardness of the critical tuple problem
Egor V. Kostylev and Dan Suciu
2018.
Details about A note on the hardness of the critical tuple problem | BibTeX data for A note on the hardness of the critical tuple problem