-
Tel, G., Vitányi, P. (1994) Distributed algorithms: 8th international workshop, WDAG '1994, Terschelling, The Netherlands, September 29 -October 1, 1994: proceedings.Lecture Notes in Computer Science. Springer.Book (Editorship) | https://doi.org/10.1007/BFb0020419 | UvA-DARE
-
ten Cate, B., Conradie, W., Marx, M., Venema, Y. (2006) Definitorially Complete Description Logics.In Doherty, P. Mylopoulos, J. Welty, C. (Eds.), Proceedings of KR 2006 (pp 79-89). AAAI Press.Conference contribution | UvA-DAREten Cate, B., Dalmau, V., Funk, M., Lutz, C. (2023) Extremal Fitting Problems for Conjunctive Queries.In PODS '23: Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems : June 18-23, 2023, Seattle, WA, USA (pp 89-98). Association for Computing Machinery.Conference contribution | https://doi.org/10.1145/3584372.3588655 | UvA-DAREten Cate, B., Dalmau, V. (2021) Conjunctive Queries: Unique Characterizations and Exact Learnability.In Yi, K. Wei, Z. (Eds.), 24th International Conference on Database Theory: ICDT 2021, March 23-26, 2021, Nicosia, Cyprus (Leibniz International Proceedings in Informatics, Vol. 186). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.Conference contribution | https://doi.org/10.4230/LIPIcs.ICDT.2021.9 | UvA-DAREten Cate, B., Dalmau, V. (2022) Conjunctive Queries: Unique Characterizations and Exact Learnability.ACM Transactions on Database Systems, Vol. 47Article | https://doi.org/10.1145/3559756 | UvA-DAREten Cate, B., Fontaine, G., Litak, T.M. (2007) Some modal aspects of XPath.In Proceedings of Methods for Modalities 2007 (pp 21-34)Conference contribution | UvA-DAREten Cate, B., Fontaine, G. (2010) An easy completeness proof for the modal μ-calculus on finite trees.In Matthes, R. Uustalu, T. (Eds.), 6th Workshop on Fixed Points in Computer Science, FICS 2009: Coimbra, Portugal, 12-13 September 2009: Proceedings (pp 30-38). Tallinn University of Technology, Institute of Cybernetics.Conference contribution | http://cs.ioc.ee/fics09/fics09proc.pdf | UvA-DAREten Cate, B., Franceschet, M. (2005) On the Complexity of hybrid logics with binders.Technical Reports. Institute for Logic, Language and Computation.Working paper | UvA-DAREten Cate, B., Funk, M., Jung, J.C., Lutz, C. (2023) Fitting Algorithms for Conjunctive Queries.SIGMOD Record, Vol. 52 (pp 6-18)Article | https://doi.org/10.1145/3641832.3641834 | UvA-DAREten Cate, B., Funk, M., Jung, J.C., Lutz, C. (2023) SAT-Based PAC Learning of Description Logic Concepts.In Elkind, E. (Eds.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence: IJCAI 2023, Macao, S.A.R, 19-25 August 2023 (pp 3347-3355). International Joint Conferences on Artificial Intelligence.Conference contribution | https://doi.org/10.24963/ijcai.2023/373 | UvA-DAREten Cate, B., Funk, M., Jung, J.C., Lutz, C. (2024) On the non-efficient PAC learnability of conjunctive queries.Information Processing Letters, Vol. 183Article | https://doi.org/10.1016/j.ipl.2023.106431 | UvA-DAREten Cate, B., Koudijs, R. (2022) Characterising Modal Formulas with Examples.Paper | https://arxiv.org/abs/2206.06049 | UvA-DAREten Cate, B., Marx, M., Viana, J.P. (2004) Sahlqvist theory for hybrid logic.In Troelstra, A. (Eds.), Liber Amicorum ter gelegenheid van het afscheid van Dick de Jongh (pp 1-6)Chapter | UvA-DAREten Cate, B., Safarova, M. (2001) Interpreting uncertain or inconsistent information using belief networks.In O'Donoghue, D. (Eds.), Proceedings of The 12th Irish Conference on Artificial Intelligence and Cognitive Science, Maynooth, Co. Kildare, Ireland, September 2001 (pp 243-252). National University of Ireland.Conference contribution | UvA-DAREten Cate, B., Safarova, M. (2001) Representing model conversation failures with belief networks.In Schreiber, G. Kröse, B. de Rijke, M. van Someren, M. (Eds.), Proceedings of BNAIC 2001, Amsterdam, October 25-26 2001 (pp 365-372)Chapter | UvA-DAREten Cate, B., Shan, C. (2002) Question answering: From partitions to prolog.In Egli, U. Fermuller, C. (Eds.), Proceedings of TABLEAUX 2002: Automated Reasoning with Analytic Tableaux and Related Methods (pp 251-265). Springer Verlag.Conference contribution | UvA-DAREten Cate, B., van Benthem, J.F.A.K., Väänänen, J. (2007) Lindström theorems for fragments of first-order logic.In Proceedings of LICS 2007 (pp 280-292)Conference contribution | UvA-DAREten Cate, B., van Eijck, J., Heguiabehere, J.M. (2001) Expressivity of extensions of dynamic predicate logic.In van Rooy, Robert Stokhof, Martin (Eds.), Proceedings of the Thirteenth Amsterdam Colloquium (pp 55-60). ILLC/Department of Philosophy.Conference contribution | UvA-DAREten Cate, B. (2001) Information exchange as reduction.In Striegnitz, Kristina (Eds.), Proceedings ESSLLI 2001 Student SessionConference contribution | UvA-DAREten Cate, B. (2001) The dynamics of information exchange dialogues.In Proceedings of FG/MOL 2001Conference contribution | UvA-DARE
The data of this list is taken from the Pure database. If you find output is missing from the list, please follow the previous link to find out how to submit to Pure. In case there are mistakes in PURE, please contact illc at uva.nl