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. 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. 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"
    }
    

  1. Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier and Thomas Zeume.
    A Strategy for Dynamic Programs: Start over and Muddle Through.
    In Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn and Anca Muscholl (eds.). 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland 80. 2017, 98:1–98:14.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/icalp/Datta0SVZ17,
    	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",
    	booktitle = "44th International Colloquium on Automata, Languages, and Programming, {ICALP} 2017, July 10-14, 2017, Warsaw, Poland",
    	pages = "98:1--98:14",
    	year = 2017,
    	editor = "Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl",
    	series = "LIPIcs",
    	volume = 80,
    	publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik",
    	isbn = "978-3-95977-041-5",
    	url = "https://doi.org/10.4230/LIPIcs.ICALP.2017.98",
    	doi = "10.4230/LIPIcs.ICALP.2017.98",
    	timestamp = "Tue, 18 Jul 2017 10:55:27 +0200",
    	biburl = "http://dblp.org/rec/bib/conf/icalp/Datta0SVZ17",
    	bibsource = "dblp computer science bibliography, http://dblp.org"
    }
    

2016

  1. Daan Apeldoorn and Gabriele Kern-Isberner.
    When Should Learning Agents Switch to Explicit Knowledge?.
    In Christoph Benzmüller, Geoff Sutcliffe and Raul Rojas (eds.). GCAI 2016. 2nd Global Conference on Artificial Intelligence 41. 2016, 174–186.
    URL BibTeX

    @inproceedings{ApeldoornKernIsberner2015b,
    	author = "Apeldoorn, Daan and Kern-Isberner, Gabriele",
    	title = "When Should Learning Agents Switch to Explicit Knowledge?",
    	booktitle = "GCAI 2016. 2nd Global Conference on Artificial Intelligence",
    	pages = "174--186",
    	year = 2016,
    	editor = {Benzm\"uller, Christoph and Sutcliffe, Geoff and Rojas, Raul},
    	volume = 41,
    	series = "EPiC Series in Computing",
    	publisher = "EasyChair Publications",
    	url = "http://easychair.org/publications/download/When_Should_Learning_Agents_Switch_to_Explicit_Knowledge"
    }
    

  1. Christoph Beierle, Christian Eichhorn and Steven Kutsch.
    A Practical Comparison of Qualitative Inferences with Preferred Ranking Models.
    KI - Künstliche Intelligenz Volume 31, Issue 1:41–52, 2016.
    BibTeX

    @article{BeierleEichhornKutsch2017,
    	author = "Beierle, Christoph AND Eichhorn, Christian AND Kutsch, Steven",
    	title = "A Practical Comparison of Qualitative Inferences with Preferred Ranking Models",
    	journal = {KI - K{\"u}nstliche Intelligenz},
    	volume = "Volume 31, Issue 1",
    	year = 2016,
    	pages = "41--52",
    	publisher = "Springer Science+Business Media",
    	address = "Berlin, DE"
    }
    

  1. Marco Ragni, Christian Eichhorn and Gabriele Kern-Isberner.
    Simulating Human Inferences in the Light of New Information: A Formal Analysis (Extended Abstract).
    In Gerhard Friedrich, Malte Helmert and Franz Wotawa (eds.). KI 2016: Advances in Artificial Intelligence – 39th Annual German Conference on AI (Proceedings) (LNAI) 9904. 2016, 297-302.
    BibTeX

    @inproceedings{RagniEichhornKernIsberner2016b,
    	author = "Ragni, Marco AND Eichhorn, Christian AND Kern-Isberner, Gabriele",
    	title = "Simulating Human Inferences in the Light of New Information: A Formal Analysis (Extended Abstract)",
    	booktitle = "KI 2016: Advances in Artificial Intelligence -- 39th Annual German Conference on AI (Proceedings)",
    	series = "Lecture Notes in Computer Science",
    	volume = "(LNAI) 9904",
    	year = 2016,
    	editor = "Friedrich, Gerhard AND Helmert, Malte AND Wotawa, Franz",
    	pages = "297-302",
    	address = "Cham, CH",
    	publisher = "Springer International Publishing"
    }
    

  1. Christoph Beierle, Christian Eichhorn and Gabriele Kern-Isberner.
    Skeptical Inference Based on C-representations and its Characterization as a Constraint Satisfaction Problem.
    In Proceedings of the 9th International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2016) 9616. 2016, 65–82.
    BibTeX

    @inproceedings{BeierleEichhornKernIsberner2016,
    	address = "Berlin, DE",
    	author = "Beierle, Christoph AND Eichhorn, Christian AND Kern-Isberner, Gabriele",
    	booktitle = "Proceedings of the 9th International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2016)",
    	date-modified = "2017-06-07 14:27:12 +0200",
    	editors = "Simari, Guillermo Ricardo AND Gyssens, Marc",
    	pages = "65--82",
    	publisher = "Springer Science+Business Media",
    	series = "Lecture Notes of Computer Science",
    	title = "{Skeptical Inference Based on C-representations and its Characterization as a Constraint Satisfaction Problem}",
    	volume = 9616,
    	year = 2016
    }
    

  1. Christoph Beierle, Christian Eichhorn, Gabriele Kern-Isberner and Steven Kutsch.
    Skeptical, Weakly Skeptical, and Credulous Inference Based on Preferred Ranking Functions.
    In Gal A Kaminka, Maria Fox, Paolo Bouquet, Eyke Hüllermeier, Virginia Dignum, Frank Dignum and Frank Harmelen (eds.). Frontiers in Artificial Intelligence and Applications Volume 285: ECAI 2016. 2016, 1149–1157.
    BibTeX

    @inproceedings{BeierleEichhornKernIsbernerKutsch2016,
    	author = "Beierle, Christoph AND Eichhorn, Christian AND Kern-Isberner, Gabriele AND Kutsch, Steven",
    	title = "Skeptical, Weakly Skeptical, and Credulous Inference Based on Preferred Ranking Functions",
    	booktitle = "Frontiers in Artificial Intelligence and Applications",
    	volume = "Volume 285: ECAI 2016",
    	year = 2016,
    	editor = "Kaminka, Gal A. AND Fox, Maria AND Bouquet, Paolo AND Hüllermeier, Eyke AND Dignum, Virginia AND Dignum, Frank AND {van Harmelen}, Frank",
    	pages = "1149--1157",
    	address = "Amsterdam, NL",
    	publisher = "IOS Press"
    }