Published in: LIPIcs, Volume 206, 28th International Symposium on Temporal Representation and Reasoning (TIME 2021)
Vladislav Ryzhikov, Yury Savateev, and Michael Zakharyaschev. Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic. In 28th International Symposium on Temporal Representation and Reasoning (TIME 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 206, pp. 10:1-10:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ryzhikov_et_al:LIPIcs.TIME.2021.10, author = {Ryzhikov, Vladislav and Savateev, Yury and Zakharyaschev, Michael}, title = {{Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic}}, booktitle = {28th International Symposium on Temporal Representation and Reasoning (TIME 2021)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-206-8}, ISSN = {1868-8969}, year = {2021}, volume = {206}, editor = {Combi, Carlo and Eder, Johann and Reynolds, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2021.10}, URN = {urn:nbn:de:0030-drops-147867}, doi = {10.4230/LIPIcs.TIME.2021.10}, annote = {Keywords: Linear temporal logic, ontology-mediated query, first-order rewritability} }
Published in: LIPIcs, Volume 200, 36th Computational Complexity Conference (CCC 2021)
Anastasia Sofronova and Dmitry Sokolov. Branching Programs with Bounded Repetitions and Flow Formulas. In 36th Computational Complexity Conference (CCC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 200, pp. 17:1-17:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{sofronova_et_al:LIPIcs.CCC.2021.17, author = {Sofronova, Anastasia and Sokolov, Dmitry}, title = {{Branching Programs with Bounded Repetitions and Flow Formulas}}, booktitle = {36th Computational Complexity Conference (CCC 2021)}, pages = {17:1--17:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-193-1}, ISSN = {1868-8969}, year = {2021}, volume = {200}, editor = {Kabanets, Valentine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.17}, URN = {urn:nbn:de:0030-drops-142915}, doi = {10.4230/LIPIcs.CCC.2021.17}, annote = {Keywords: proof complexity, branching programs, bounded repetitions, lower bounds} }
Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)
Zsolt Zombori, János Csorba, and Péter Szeredi. Static Type Checking for the Q Functional Language in Prolog. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 62-72, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{zombori_et_al:LIPIcs.ICLP.2011.62, author = {Zombori, Zsolt and Csorba, J\'{a}nos and Szeredi, P\'{e}ter}, title = {{Static Type Checking for the Q Functional Language in Prolog}}, booktitle = {Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)}, pages = {62--72}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-31-6}, ISSN = {1868-8969}, year = {2011}, volume = {11}, editor = {Gallagher, John P. and Gelfond, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.62}, URN = {urn:nbn:de:0030-drops-31718}, doi = {10.4230/LIPIcs.ICLP.2011.62}, annote = {Keywords: logic programming, types, static type checking, constraints, CHR, DCG} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Michael Clause, Rolf Klein, and Ian H. Witten. Multimedia Retrieval (Dagstuhl Seminar 03112). Dagstuhl Seminar Report 371, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2003)
@TechReport{clause_et_al:DagSemRep.371, author = {Clause, Michael and Klein, Rolf and Witten, Ian H.}, title = {{Multimedia Retrieval (Dagstuhl Seminar 03112)}}, pages = {1--4}, ISSN = {1619-0203}, year = {2003}, type = {Dagstuhl Seminar Report}, number = {371}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.371}, URN = {urn:nbn:de:0030-drops-152517}, doi = {10.4230/DagSemRep.371}, }
Feedback for Dagstuhl Publishing