2020

  1. Jesse Heyninck, Gabriele Kern-Isberner and Matthias Thimm.
    On the Correspondence Between Abstract Dialectical Frameworks and Nonmonotonic Conditional Logics.
    In The Thirty-Third International Flairs Conference. 2020.
    URL BibTeX

    @inproceedings{heyninck2020correspondence,
    	title = "On the Correspondence Between Abstract Dialectical Frameworks and Nonmonotonic Conditional Logics",
    	author = "Heyninck, Jesse and Kern-Isberner, Gabriele and Thimm, Matthias",
    	booktitle = "The Thirty-Third International Flairs Conference",
    	year = 2020,
    	url = "https://www.aaai.org/ocs/index.php/FLAIRS/FLAIRS20/paper/viewPaper/18502"
    }
    

  1. Ofer Arieli and Jesse Heyninck.
    .
    In 24th European Conference on Artificial Intelligence - ECAI 2020. 2020.
    URL BibTeX

    @inproceedings{,
    	heyninck2020c title = "Prioritized Simple Contrapositive Assumption-Based Frameworks",
    	author = "Arieli, Ofer and Heyninck, Jesse",
    	booktitle = "24th European Conference on Artificial Intelligence - ECAI 2020",
    	year = 2020,
    	url = "http://ecai2020.eu/papers/734_paper.pdf"
    }
    

  1. Jesse Heyninck and Christian Straßer.
    Rationality and maximal consistent sets for a fragment of ASPIC+ without undercut.
    Argument & Computation (Preprint):1–45.
    URL BibTeX

    @article{heyninckrationality,
    	title = "Rationality and maximal consistent sets for a fragment of ASPIC+ without undercut",
    	author = "Heyninck, Jesse and Stra{\ss}er, Christian",
    	journal = "Argument \& Computation",
    	number = "Preprint",
    	pages = "1--45",
    	publisher = "IOS Press",
    	url = "https://content.iospress.com/articles/argument-and-computation/aac200903"
    }
    

  1. Jesse Heyninck and Ofer Arieli.
    Simple contrapositive assumption-based argumentation frameworks.
    International Journal of Approximate Reasoning, 2020.
    Abstract Assumption-based argumentation is one of the most prominent formalisms for logical (or structured) argumentation, with tight links to different forms of defeasible reasoning. In this paper we study the Dung semantics for extended forms of assumption-based argumentation frameworks (ABFs), based on any contrapositive propositional logic, and whose defeasible assumptions are expressed by arbitrary formulas in that logic. We show that unless the falsity propositional constant is part of the defeasible assumptions, the grounded and the well-founded semantics for ABFs lack most of the desirable properties they have in abstract argumentation frameworks (AAFs), and that for simple definitions of the contrariness operator and the attacks relations, preferred and stable semantics are reduced to naive semantics. We also show the redundancy of the closure condition in the standard definition of Dung's semantics for ABFs, and investigate the use of disjunctive attacks in this setting. Finally, we show some close relations of reasoning with ABFs to reasoning with maximally consistent sets of premises, and consider some properties of the induced entailments, such as being cumulative, preferential, or rational relations that satisfy non-interference.
    URL, DOI BibTeX

    @article{HEYNINCK2020,
    	title = "Simple contrapositive assumption-based argumentation frameworks",
    	journal = "International Journal of Approximate Reasoning",
    	year = 2020,
    	issn = "0888-613X",
    	doi = "https://doi.org/10.1016/j.ijar.2020.02.011",
    	url = "http://www.sciencedirect.com/science/article/pii/S0888613X19303639",
    	author = "Jesse Heyninck and Ofer Arieli",
    	keywords = "Structured argumentation, Dung's semantics, Assumption-based argumentation, Deductive argumentation, Defeasible reasoning, Inconsistency management",
    	abstract = "Assumption-based argumentation is one of the most prominent formalisms for logical (or structured) argumentation, with tight links to different forms of defeasible reasoning. In this paper we study the Dung semantics for extended forms of assumption-based argumentation frameworks (ABFs), based on any contrapositive propositional logic, and whose defeasible assumptions are expressed by arbitrary formulas in that logic. We show that unless the falsity propositional constant is part of the defeasible assumptions, the grounded and the well-founded semantics for ABFs lack most of the desirable properties they have in abstract argumentation frameworks (AAFs), and that for simple definitions of the contrariness operator and the attacks relations, preferred and stable semantics are reduced to naive semantics. We also show the redundancy of the closure condition in the standard definition of Dung's semantics for ABFs, and investigate the use of disjunctive attacks in this setting. Finally, we show some close relations of reasoning with ABFs to reasoning with maximally consistent sets of premises, and consider some properties of the induced entailments, such as being cumulative, preferential, or rational relations that satisfy non-interference."
    }
    

2019

  1. Frank Neven, Thomas Schwentick, Christopher Spinrath and Brecht Vandevoort.
    Parallel-Correctness and Parallel-Boundedness for Datalog Programs.
    In Pablo Barceló and Marco Calautti (eds.). 22nd International Conference on Database Theory, ICDT 2019, March 26-28, 2019, Lisbon, Portugal 127. 2019, 14:1–14:19.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/icdt/NevenSSV19,
    	author = "Frank Neven and Thomas Schwentick and Christopher Spinrath and Brecht Vandevoort",
    	editor = "Pablo Barcel{\'{o}} and Marco Calautti",
    	title = "Parallel-Correctness and Parallel-Boundedness for Datalog Programs",
    	booktitle = "22nd International Conference on Database Theory, {ICDT} 2019, March 26-28, 2019, Lisbon, Portugal",
    	series = "LIPIcs",
    	volume = 127,
    	pages = "14:1--14:19",
    	publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik",
    	year = 2019,
    	url = "https://doi.org/10.4230/LIPIcs.ICDT.2019.14",
    	doi = "10.4230/LIPIcs.ICDT.2019.14",
    	timestamp = "Tue, 14 May 2019 15:18:30 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/icdt/NevenSSV19",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier and Thomas Zeume.
    A Strategy for Dynamic Programs: Start over and Muddle through.
    Logical Methods in Computer Science 15(2), 2019.
    URL BibTeX

    @article{DBLP:journals/lmcs/DattaMSVZ19,
    	author = "Samir Datta and Anish Mukherjee and Thomas Schwentick and Nils Vortmeier and Thomas Zeume",
    	title = "A Strategy for Dynamic Programs: Start over and Muddle through",
    	journal = "Logical Methods in Computer Science",
    	volume = 15,
    	number = 2,
    	year = 2019,
    	url = "https://lmcs.episciences.org/5442",
    	timestamp = "Thu, 09 May 2019 12:01:35 +0200",
    	biburl = "https://dblp.org/rec/bib/journals/lmcs/DattaMSVZ19",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

2018

  1. Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick and Thomas Zeume.
    Reachability Is in DynFO.
    J. ACM 65(5):33:1–33:24, 2018.
    URL, DOI BibTeX

    @article{DBLP:journals/jacm/DattaKMSZ18,
    	author = "Samir Datta and Raghav Kulkarni and Anish Mukherjee and Thomas Schwentick and Thomas Zeume",
    	title = "Reachability Is in DynFO",
    	journal = "J. {ACM}",
    	volume = 65,
    	number = 5,
    	pages = "33:1--33:24",
    	year = 2018,
    	url = "https://doi.org/10.1145/3212685",
    	doi = "10.1145/3212685",
    	timestamp = "Wed, 21 Nov 2018 12:44:29 +0100",
    	biburl = "https://dblp.org/rec/bib/journals/jacm/DattaKMSZ18",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Henrik Björklund, Wim Martens and Thomas Schwentick.
    Conjunctive query containment over trees using schema information.
    Acta Inf. 55(1):17–56, 2018.
    URL, DOI BibTeX

    @article{DBLP:journals/acta/BjorklundMS18,
    	author = {Henrik Bj{\"{o}}rklund and Wim Martens and Thomas Schwentick},
    	title = "Conjunctive query containment over trees using schema information",
    	journal = "Acta Inf.",
    	volume = 55,
    	number = 1,
    	pages = "17--56",
    	year = 2018,
    	url = "https://doi.org/10.1007/s00236-016-0282-1",
    	doi = "10.1007/s00236-016-0282-1",
    	timestamp = "Wed, 07 Feb 2018 13:19:42 +0100",
    	biburl = "https://dblp.org/rec/bib/journals/acta/BjorklundMS18",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Samir Datta, Anish Mukherjee, Nils Vortmeier and Thomas Zeume.
    Reachability and Distances under Multiple Changes.
    In Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx and Donald Sannella (eds.). 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic 107. 2018, 120:1–120:14.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/icalp/Datta0VZ18,
    	author = "Samir Datta and Anish Mukherjee and Nils Vortmeier and Thomas Zeume",
    	title = "Reachability and Distances under Multiple Changes",
    	booktitle = "45th International Colloquium on Automata, Languages, and Programming, {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic",
    	pages = "120:1--120:14",
    	year = 2018,
    	url = "https://doi.org/10.4230/LIPIcs.ICALP.2018.120",
    	doi = "10.4230/LIPIcs.ICALP.2018.120",
    	timestamp = "Sat, 28 Jul 2018 14:39:07 +0200",
    	editor = "Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'{a}}niel Marx and Donald Sannella",
    	series = "LIPIcs",
    	volume = 107,
    	publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik",
    	isbn = "978-3-95977-076-7"
    }
    

  1. Matthias Niewerth and Thomas Schwentick.
    Reasoning About XML Constraints Based on XML-to-Relational Mappings.
    Theory Comput. Syst. 62(8):1826–1879, 2018.
    URL, DOI BibTeX

    @article{DBLP:journals/mst/NiewerthS18,
    	author = "Matthias Niewerth and Thomas Schwentick",
    	title = "Reasoning About {XML} Constraints Based on XML-to-Relational Mappings",
    	journal = "Theory Comput. Syst.",
    	volume = 62,
    	number = 8,
    	pages = "1826--1879",
    	year = 2018,
    	url = "https://doi.org/10.1007/s00224-018-9846-5",
    	doi = "10.1007/s00224-018-9846-5",
    	timestamp = "Tue, 11 Sep 2018 14:56:31 +0200",
    	biburl = "https://dblp.org/rec/bib/journals/mst/NiewerthS18",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu and Ke Yi.
    Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151).
    Dagstuhl Manifestos 7(1):1–29, 2018.
    URL, DOI BibTeX

    @article{DBLP:journals/dagstuhl-manifestos/AbiteboulABBCD018,
    	author = {Serge Abiteboul and Marcelo Arenas and Pablo Barcel{\'{o}} and Meghyn Bienvenu and Diego Calvanese and Claire David and Richard Hull and Eyke H{\"{u}}llermeier and Benny Kimelfeld and Leonid Libkin and Wim Martens and Tova Milo and Filip Murlak and Frank Neven and Magdalena Ortiz and Thomas Schwentick and Julia Stoyanovich and Jianwen Su and Dan Suciu and Victor Vianu and Ke Yi},
    	title = "Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151)",
    	journal = "Dagstuhl Manifestos",
    	volume = 7,
    	number = 1,
    	pages = "1--29",
    	year = 2018,
    	url = "https://doi.org/10.4230/DagMan.7.1.1",
    	doi = "10.4230/DagMan.7.1.1",
    	timestamp = "Tue, 10 Apr 2018 11:31:23 +0200",
    	biburl = "https://dblp.org/rec/bib/journals/dagstuhl-manifestos/AbiteboulABBCD018",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Dexter Kozen and Thomas Schwentick.
    The Ackermann Award 2018.
    In Dan R Ghica and Achim Jung (eds.). 27th EACSL Annual Conference on Computer Science Logic, CSL 2018, September 4-7, 2018, Birmingham, UK 119. 2018, 1:1–1:5.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/csl/KozenS18,
    	author = "Dexter Kozen and Thomas Schwentick",
    	editor = "Dan R. Ghica and Achim Jung",
    	title = "The Ackermann Award 2018",
    	booktitle = "27th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2018, September 4-7, 2018, Birmingham, {UK}",
    	series = "LIPIcs",
    	volume = 119,
    	pages = "1:1--1:5",
    	publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik",
    	year = 2018,
    	url = "https://doi.org/10.4230/LIPIcs.CSL.2018.1",
    	doi = "10.4230/LIPIcs.CSL.2018.1",
    	timestamp = "Thu, 02 May 2019 17:40:11 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/csl/KozenS18",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Thomas Schwentick, Nils Vortmeier and Thomas Zeume.
    Dynamic Complexity under Definable Changes.
    ACM Trans. Database Syst. 43(3):12:1–12:38, 2018.
    URL, DOI BibTeX

    @article{DBLP:journals/tods/SchwentickVZ18,
    	author = "Thomas Schwentick and Nils Vortmeier and Thomas Zeume",
    	title = "Dynamic Complexity under Definable Changes",
    	journal = "{ACM} Trans. Database Syst.",
    	volume = 43,
    	number = 3,
    	pages = "12:1--12:38",
    	year = 2018,
    	url = "https://doi.org/10.1145/3241040",
    	doi = "10.1145/3241040",
    	timestamp = "Thu, 09 May 2019 13:10:55 +0200",
    	biburl = "https://dblp.org/rec/bib/journals/tods/SchwentickVZ18",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

2017

  1. Thomas Schwentick, Nils Vortmeier and Thomas Zeume.
    Dynamic Complexity under Definable Changes.
    In Michael Benedikt and Giorgio Orsi (eds.). 20th International Conference on Database Theory, ICDT 2017, March 21-24, 2017, Venice, Italy 68. 2017, 19:1–19:18.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/icdt/SchwentickVZ17,
    	author = "Thomas Schwentick and Nils Vortmeier and Thomas Zeume",
    	title = "Dynamic Complexity under Definable Changes",
    	booktitle = "20th International Conference on Database Theory, {ICDT} 2017, March 21-24, 2017, Venice, Italy",
    	pages = "19:1--19:18",
    	year = 2017,
    	url = "https://doi.org/10.4230/LIPIcs.ICDT.2017.19",
    	doi = "10.4230/LIPIcs.ICDT.2017.19",
    	timestamp = "Tue, 23 May 2017 01:12:16 +0200",
    	biburl = "http://dblp.org/rec/bib/conf/icdt/SchwentickVZ17",
    	bibsource = "dblp computer science bibliography, http://dblp.org",
    	editor = "Michael Benedikt and Giorgio Orsi",
    	series = "LIPIcs",
    	volume = 68,
    	publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik",
    	isbn = "978-3-95977-024-8"
    }