Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Bartosz Bednarczyk, Daumantas Kojelis, and Ian Pratt-Hartmann. On the Limits of Decision: the Adjacent Fragment of First-Order Logic. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 111:1-111:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{bednarczyk_et_al:LIPIcs.ICALP.2023.111, author = {Bednarczyk, Bartosz and Kojelis, Daumantas and Pratt-Hartmann, Ian}, title = {{On the Limits of Decision: the Adjacent Fragment of First-Order Logic}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {111:1--111:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.111}, URN = {urn:nbn:de:0030-drops-181632}, doi = {10.4230/LIPIcs.ICALP.2023.111}, annote = {Keywords: decidability, satisfiability, variable-ordered logics, complexity} }
Published in: LIPIcs, Volume 252, 31st EACSL Annual Conference on Computer Science Logic (CSL 2023)
Ian Pratt-Hartmann and Lidia Tendera. Adding Transitivity and Counting to the Fluted Fragment. In 31st EACSL Annual Conference on Computer Science Logic (CSL 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 252, pp. 32:1-32:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{pratthartmann_et_al:LIPIcs.CSL.2023.32, author = {Pratt-Hartmann, Ian and Tendera, Lidia}, title = {{Adding Transitivity and Counting to the Fluted Fragment}}, booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)}, pages = {32:1--32:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-264-8}, ISSN = {1868-8969}, year = {2023}, volume = {252}, editor = {Klin, Bartek and Pimentel, Elaine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.32}, URN = {urn:nbn:de:0030-drops-174933}, doi = {10.4230/LIPIcs.CSL.2023.32}, annote = {Keywords: fluted logic, transitivity, counting, satisfiability, decidability, complexity} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Ian Pratt-Hartmann. Fluted Logic with Counting. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 141:1-141:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{pratthartmann:LIPIcs.ICALP.2021.141, author = {Pratt-Hartmann, Ian}, title = {{Fluted Logic with Counting}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {141:1--141:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.141}, URN = {urn:nbn:de:0030-drops-142101}, doi = {10.4230/LIPIcs.ICALP.2021.141}, annote = {Keywords: Fluted fragment, counting quantifiers, satisfiability, complexity} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Ian Pratt-Hartmann and Lidia Tendera. The Fluted Fragment with Transitivity. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 18:1-18:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{pratthartmann_et_al:LIPIcs.MFCS.2019.18, author = {Pratt-Hartmann, Ian and Tendera, Lidia}, title = {{The Fluted Fragment with Transitivity}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {18:1--18:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.18}, URN = {urn:nbn:de:0030-drops-109626}, doi = {10.4230/LIPIcs.MFCS.2019.18}, annote = {Keywords: First-Order logic, Decidability, Satisfiability, Transitivity, Complexity} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Ian Pratt-Hartmann, Wieslaw Szwast, and Lidia Tendera. Quine's Fluted Fragment is Non-Elementary. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 39:1-39:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{pratthartmann_et_al:LIPIcs.CSL.2016.39, author = {Pratt-Hartmann, Ian and Szwast, Wieslaw and Tendera, Lidia}, title = {{Quine's Fluted Fragment is Non-Elementary}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {39:1--39:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.39}, URN = {urn:nbn:de:0030-drops-65791}, doi = {10.4230/LIPIcs.CSL.2016.39}, annote = {Keywords: Quine, fluted fragment, Purdy, non-elementary, satisfiability, decidability} }
Published in: Dagstuhl Seminar Proceedings, Volume 5151, Annotating, Extracting and Reasoning about Time and Events (2005)
Ian Pratt-Hartmann. From TimeML to TPL. In Annotating, Extracting and Reasoning about Time and Events. Dagstuhl Seminar Proceedings, Volume 5151, pp. 1-11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2005)
@InProceedings{pratthartmann:DagSemProc.05151.8, author = {Pratt-Hartmann, Ian}, title = {{From TimeML to TPL}}, booktitle = {Annotating, Extracting and Reasoning about Time and Events}, pages = {1--11}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5151}, editor = {Graham Katz and James Pustejovsky and Frank Schilder}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05151.8}, URN = {urn:nbn:de:0030-drops-3128}, doi = {10.4230/DagSemProc.05151.8}, annote = {Keywords: Information Extraction, Interval temporal logic} }
Feedback for Dagstuhl Publishing