Chekol, M. W., Pirrò, G. and Stuckenschmidt, H. (2019). Fast interval joins for temporal SPARQL queries.
In , The Web Conference 2019 : companion of The World Wide Web Conference WWW 2019 : May 13–17, 2019, San Francisco, CA, USA (S. 1148-1154). ,
Association for Computing Machinery: New York, NY.
Chekol, M. W. and Stuckenschmidt, H. (2019). Leveraging graph neighborhoods for efficient inference.
In , CIKM '19 : proceedings of the 28th ACM International Conference on Information and Knowledge Management (S. 1893-1902). ,
Association for Computing Machinery: New York, NY.
Chekol, M. W. and Stuckenschmidt, H. (2019). Time-aware probabilistic knowledge graphs.
In , 26th International Symposium on Temporal Representation and Reasoning : TIME 2019, October 16–19, 2019, Málaga, Spain (S. 1–17). Leibniz International Proceedings in Informatics : LIPIcs,
Schloss Dagstuhl – Leibniz-Zentrum für Informatik: Wadern.
Meilicke, C., Chekol, M. W., Ruffinelli, D. and Stuckenschmidt, H. (2019). An introduction to AnyBURL.
In , KI 2019: Advances in Artificial Intelligence : 42nd German Conference on AI, Kassel, Germany, September 23–26, 2019, proceedings (S. 244–248). Lecture Notes in Computer Science,
Springer: Berlin [u.a.].
Meilicke, C., Chekol, M. W., Ruffinelli, D. and Stuckenschmidt, H. (2019). Anytime bottom-up rule learning for knowledge graph completion.
In , Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI-19) : August 10–16, 2019, Macao, China (S. 3137-3143). ,
IJCAI/AAAI Press: Menlo Park, CA.
Chekol, M. W. and Stuckenschmidt, H. (2018). Towards partition-aware lifted inference.
In , CIKM'18 : proceedings of the 27th ACM International Conference on Information and Knowledge Management : October 22–26, 2018, Torino, Italy (S. 1823-1826). ,
ACM Digital Library: New York, NY.
Chekol, M. W. and Stuckenschmidt, H. (2018). Towards probabilistic bitemporal knowledge graphs.
In , WWW '18 : Companion Proceedings of the The Web Conference 2018 : Lyon, France, April 23 – 27, 2018 (S. 1757-1762). ,
ACM Digital Library: New York, NY.
Chekol, M. W. and Stuckenschmidt, H. (2018). Tractable reasoning in probabilistic OWL profiles.
In , Proceedings of the 33rd Annual ACM Symposium on Applied Computing 2018 (S. 888–895). ,
ACM Digital Library: New York, NY.
Leblay, J. and Chekol, M. W. (2018). Deriving validity time in knowledge graph.
In , WWW '18 : Companion Proceedings of the The Web Conference 2018 : Lyon, France, April 23 – 27, 2018 (S. 1771-1776). ,
ACM Digital Library: New York, NY.
Chekol, M. (2017). Scaling probabilistic temporal query evaluation.
In , Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, CIKM 2017, Singapore, November 06 – 10, 2017 (S. 697–706). ,
ACM: New York, NY.
Chekol, M. W., Pirrò, G., Schönfisch, J. and Stuckenschmidt, H. (2017). Marrying uncertainty and time in knowledge graphs.
In , Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence and the Twenty-Ninth Innovative Applications of Artificial Intelligence Conference : February 4–9, 2017, San Francisco, California USA (S. 88–94). ,
AAAI Press: San Francisco, CA.
Chekol, M. W., Pirrò, G., Schönfisch, J. and Stuckenschmidt, H. (2017). TeCoRe: temporal conflict resolution in knowledge graphs.
In , Proceedings of the VLDB Endowment : 43. International Conference on Very Large Data Bases (S. Iss. 12, 1929-1932). Proceedings of the VLDB Endowment,
Association of Computing Machinery: New York, NY.
Chekol, M. W. and Stuckenschmidt, H. (2017). Rule based temporal inference.
In , Technical communications of the 33rd International Conference on Logic Programming : ICLP 2017, August 28-September 1, 2017, Melbourne, Australia (S. Article 4, 1–14). Open Access Series in Informatics : OASIcs,
Dagstuhl Publishing: Wadern.
Nolle, A., Chekol, M. W., Meilicke, C., Nemirovski, G. and Stuckenschmidt, H. (2017). Automated fine-grained trust assessment in federated knowledge bases.
In , The Semantic Web – ISWC 2017 : 16th International Semantic Web Conference, Vienna, Austria, October 21–25, 2017 : proceedings. Part I (S. 490–506). Lecture Notes in Computer Science,
Springer: Berlin [u.a.].
Chekol, M. (2016). On the containment of SPARQL queries under entailment regimes.
In , Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence and the Twenty-Eighth Innovative Applications of Artificial Intelligence Conference, February 12–17, 2016, Phoenix, Arizona, USA (S. 936–942). ,
AAAI Press: Palo Alto, Calif..
Chekol, M. W., Huber, J., Meilicke, C. and Stuckenschmidt, H. (2016). Markov logic networks with numerical constraints.
In , ECAI 2016 : 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands : including Prestigious applications of intelligent systems (PAIS 2016) : proceedings (S. 1017-1025). Frontiers in Artificial Intelligence and Applications,
IOS Press BV: Amsterdam.
Chekol, M. W. and Pirrò, G. (2016). Containment of expressive SPARQL navigational queries.
In , The Semantic Web – ISWC 2016 : 15th International Semantic Web Conference, Kobe, Japan, October 17–21, 2016, Proceedings, Part I (S. 86–101). Lecture Notes in Computer Science,
Springer: Berlin [u.a.].
Chekol, M. W. and Stuckenschmidt, H. (2016). Uncertain temporal knowledge graphs.
In , URSW 2016 : Proceedings of the 12th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2016) co-located with the 15th International Semantic Web Conference (ISWC 2016) Kobe, Japan, October 17, 2016 (S. 1–12). CEUR Workshop Proceedings,
RWTH Aachen: Aachen, Germany.
Nolle, A., Meilicke, C., Chekol, M. W., Nemirovski, G. and Stuckenschmidt, H. (2016). Schema-based debugging of federated data sources.
In , ECAI 2016 : 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands : including Prestigious applications of intelligent systems (PAIS 2016) : proceedings (S. 381–389). Frontiers in Artificial Intelligence and Applications,
IOS Press BV: Amsterdam.
Chekol, M. W., Huber, J., Meilicke, C. and Stuckenschmidt, H. (2015). Probabilistic EL++ with nominals and concrete domains.
In , Working Papers of the IJCAI-2015 Workshop on Weighted Logics for Artificial Intelligence WL4AI-2015, July 27, 2015, Buenos Aires (Argentina) (S. 80–87). ,
University of Sao Paulo: Sao Paulo.
In order to improve performance and enhance the user experience for the visitors to our website, we use cookies and store anonymous usage data. For more information please read our privacy policy.