2020

  1. Marco Wilhelm and Gabriele Kern-Isberner.
    Context-Based Inferences from Probabilistic Conditionals with Default Negation at Maximum Entropy.
    In Roman Barták and Eric Bell (eds.). Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, Originally to be held in North Miami Beach, Florida, USA, May 17-20, 2020. 2020, 593–598.
    URL BibTeX

    @inproceedings{DBLP:conf/flairs/WilhelmK20,
    	author = "Marco Wilhelm and Gabriele Kern{-}Isberner",
    	editor = "Roman Bart{\'{a}}k and Eric Bell",
    	title = "Context-Based Inferences from Probabilistic Conditionals with Default Negation at Maximum Entropy",
    	booktitle = "Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, Originally to be held in North Miami Beach, Florida, USA, May 17-20, 2020",
    	pages = "593--598",
    	publisher = "{AAAI} Press",
    	year = 2020,
    	url = "https://aaai.org/ocs/index.php/FLAIRS/FLAIRS20/paper/view/18505",
    	timestamp = "Thu, 04 Jun 2020 14:36:27 +0200",
    	biburl = "https://dblp.org/rec/conf/flairs/WilhelmK20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Meliha Sezgin and Gabriele Kern-Isberner.
    Generalized Ranking Kinematics for Iterated Belief Revision.
    In Roman Barták and Eric Bell (eds.). Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, Originally to be held in North Miami Beach, Florida, USA, May 17-20, 2020. 2020, 587–592.
    URL BibTeX

    @inproceedings{DBLP:conf/flairs/SezginK20,
    	author = "Meliha Sezgin and Gabriele Kern{-}Isberner",
    	editor = "Roman Bart{\'{a}}k and Eric Bell",
    	title = "Generalized Ranking Kinematics for Iterated Belief Revision",
    	booktitle = "Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, Originally to be held in North Miami Beach, Florida, USA, May 17-20, 2020",
    	pages = "587--592",
    	publisher = "{AAAI} Press",
    	year = 2020,
    	url = "https://aaai.org/ocs/index.php/FLAIRS/FLAIRS20/paper/view/18504",
    	timestamp = "Thu, 04 Jun 2020 14:36:27 +0200",
    	biburl = "https://dblp.org/rec/conf/flairs/SezginK20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

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

  1. Alejandro Veloz, Claudio Moraga, Alejandro J Weinstein, Luis Hernandez-Garcia, Steren Chabert, Rodrigo Salas, Rodrigo Riveros, Carlos Bennett and Héctor Allende.
    Fuzzy General Linear Modeling for Functional Magnetic Resonance Imaging Analysis.
    IEEE Trans. Fuzzy Syst. 28(1):100–111, 2020.
    URL, DOI BibTeX

    @article{DBLP:journals/tfs/VelozMWHCSRBA20,
    	author = "Alejandro Veloz and Claudio Moraga and Alejandro J. Weinstein and Luis Hernandez{-}Garcia and Steren Chabert and Rodrigo Salas and Rodrigo Riveros and Carlos Bennett and H{\'{e}}ctor Allende",
    	title = "Fuzzy General Linear Modeling for Functional Magnetic Resonance Imaging Analysis",
    	journal = "{IEEE} Trans. Fuzzy Syst.",
    	volume = 28,
    	number = 1,
    	pages = "100--111",
    	year = 2020,
    	url = "https://doi.org/10.1109/TFUZZ.2019.2936807",
    	doi = "10.1109/TFUZZ.2019.2936807",
    	timestamp = "Tue, 12 May 2020 16:52:31 +0200",
    	biburl = "https://dblp.org/rec/journals/tfs/VelozMWHCSRBA20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Caroline Barbieri and Claudio Moraga.
    On the Complexity of the Cycles based Synthesis of Ternary Reversible Circuits.
    CoRR abs/2002.07498, 2020.
    URL BibTeX

    @article{DBLP:journals/corr/abs-2002-07498,
    	author = "Caroline Barbieri and Claudio Moraga",
    	title = "On the Complexity of the Cycles based Synthesis of Ternary Reversible Circuits",
    	journal = "CoRR",
    	volume = "abs/2002.07498",
    	year = 2020,
    	url = "https://arxiv.org/abs/2002.07498",
    	archiveprefix = "arXiv",
    	eprint = "2002.07498",
    	timestamp = "Mon, 02 Mar 2020 16:46:06 +0100",
    	biburl = "https://dblp.org/rec/journals/corr/abs-2002-07498.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Pawel Kerntopf, Claudio Moraga, Krzysztof Podlaski and Radomir S Stankovic.
    Research on Reversible Functions Having Component Functions with Specified Properties: An Overview.
    In Irek Ulidowski, Ivan Lanese, Ulrik Pagh Schultz and Carla Ferreira (eds.). Reversible Computation: Extending Horizons of Computing - Selected Results of the COST Action IC1405. Lecture Notes in Computer Science series, volume 12070, Springer, 2020, pages 83–107.
    URL, DOI BibTeX

    @incollection{DBLP:series/lncs/KerntopfMPS20,
    	author = "Pawel Kerntopf and Claudio Moraga and Krzysztof Podlaski and Radomir S. Stankovic",
    	editor = "Irek Ulidowski and Ivan Lanese and Ulrik Pagh Schultz and Carla Ferreira",
    	title = "Research on Reversible Functions Having Component Functions with Specified Properties: An Overview",
    	booktitle = "Reversible Computation: Extending Horizons of Computing - Selected Results of the {COST} Action {IC1405}",
    	series = "Lecture Notes in Computer Science",
    	volume = 12070,
    	pages = "83--107",
    	publisher = "Springer",
    	year = 2020,
    	url = "https://doi.org/10.1007/978-3-030-47361-7\_4",
    	doi = "10.1007/978-3-030-47361-7\_4",
    	timestamp = "Mon, 15 Jun 2020 16:48:13 +0200",
    	biburl = "https://dblp.org/rec/series/lncs/KerntopfMPS20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Gaetano Geck, Frank Neven and Thomas Schwentick.
    Distribution Constraints: The Chase for Distributed Data.
    In Carsten Lutz and Jean Christoph Jung (eds.). 23rd International Conference on Database Theory, ICDT 2020, March 30-April 2, 2020, Copenhagen, Denmark 155. 2020, 13:1–13:19.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/icdt/GeckNS20,
    	author = "Gaetano Geck and Frank Neven and Thomas Schwentick",
    	editor = "Carsten Lutz and Jean Christoph Jung",
    	title = "Distribution Constraints: The Chase for Distributed Data",
    	booktitle = "23rd International Conference on Database Theory, {ICDT} 2020, March 30-April 2, 2020, Copenhagen, Denmark",
    	series = "LIPIcs",
    	volume = 155,
    	pages = "13:1--13:19",
    	publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
    	year = 2020,
    	url = "https://doi.org/10.4230/LIPIcs.ICDT.2020.13",
    	doi = "10.4230/LIPIcs.ICDT.2020.13",
    	timestamp = "Thu, 19 Mar 2020 10:24:23 +0100",
    	biburl = "https://dblp.org/rec/conf/icdt/GeckNS20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume and Ioannis Kokkinis.
    Dynamic Complexity Meets Parameterised Algorithms.
    In Maribel Fernández and Anca Muscholl (eds.). 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain 152. 2020, 36:1–36:17.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/csl/SchmidtSVZK20,
    	author = "Jonas Schmidt and Thomas Schwentick and Nils Vortmeier and Thomas Zeume and Ioannis Kokkinis",
    	editor = "Maribel Fern{\'{a}}ndez and Anca Muscholl",
    	title = "Dynamic Complexity Meets Parameterised Algorithms",
    	booktitle = "28th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2020, January 13-16, 2020, Barcelona, Spain",
    	series = "LIPIcs",
    	volume = 152,
    	pages = "36:1--36:17",
    	publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
    	year = 2020,
    	url = "https://doi.org/10.4230/LIPIcs.CSL.2020.36",
    	doi = "10.4230/LIPIcs.CSL.2020.36",
    	timestamp = "Mon, 15 Jun 2020 17:01:53 +0200",
    	biburl = "https://dblp.org/rec/conf/csl/SchmidtSVZK20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

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

  1. Pawel Kerntopf, Krzysztof Podlaski, Claudio Moraga and Radomir S Stankovic.
    New Results on Reversible Boolean Functions having Component Functions with Specific Properties.
    In Rolf Drechsler and Mathias Soeken (eds.). Advanced Boolean Techniques. Springer, 2019, pages 217–236.
    URL, DOI BibTeX

    @incollection{KerntopfPMS19,
    	author = "Pawel Kerntopf and Krzysztof Podlaski and Claudio Moraga and Radomir S. Stankovic",
    	title = "New Results on Reversible Boolean Functions having Component Functions with Specific Properties",
    	booktitle = "Advanced Boolean Techniques",
    	editor = "Rolf Drechsler and Mathias Soeken",
    	pages = "217--236",
    	year = 2019,
    	publisher = "Springer",
    	doi = "10.1007/978-3-030-20323-8_10",
    	url = "https://link.springer.com/chapter/10.1007/978-3-030-20323-8_10"
    }
    

  1. Martin Lukac, Claudio Moraga and Michitaka Kameyama.
    Properties of Bent Functions in the Truth Domain.
    In International Conference on Information and Digital Technologies (IDT), Zilina, Slovakia, June 25-27, 2019. 2019, 305–311.
    URL, DOI BibTeX

    @inproceedings{ LukacMK19,
    	author = "Martin Lukac and Claudio Moraga and Michitaka Kameyama",
    	title = "Properties of Bent Functions in the Truth Domain",
    	booktitle = "International Conference on Information and Digital Technologies (IDT), Zilina, Slovakia, June 25-27, 2019",
    	pages = "305--311",
    	year = 2019,
    	doi = "10.1109/DT.2019.8813751",
    	url = "https://ieeexplore.ieee.org/document/8813751"
    }
    

  1. Radomir S Stankovic, Milena M Stankovic, Jaakko Astola and Claudio Moraga.
    Towards the Structure of a Class of Permutation Matrices Associated to Bent Functions.
    In Rolf Drechsler and Mathias Soeken (eds.). Advanced Boolean Techniques. Springer, 2019, pages 83–105.
    URL, DOI BibTeX

    @incollection{StankovicSAM19,
    	author = "Radomir S. Stankovic and Milena M. Stankovic and Jaakko Astola and Claudio Moraga",
    	title = "Towards the Structure of a Class of Permutation Matrices Associated to Bent Functions",
    	booktitle = "Advanced Boolean Techniques",
    	editor = "Rolf Drechsler and Mathias Soeken",
    	pages = "83--105",
    	year = 2019,
    	publisher = "Springer",
    	doi = "10.1007/978-3-030-20323-8_4",
    	url = "https://link.springer.com/chapter/10.1007%2F978-3-030-20323-8_4"
    }
    

  1. Radomir S Stankovic, Milena Stankovic, Jaakko T Astola and Claudio Moraga.
    Remarks on Similarities Among Ternary Bent Functions.
    In 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL), Fredericton, NB, Canada, May 21-23, 2019. 2019, 79–84.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/ismvl/StankovicSAM19,
    	author = "Radomir S. Stankovic and Milena Stankovic and Jaakko T. Astola and Claudio Moraga",
    	title = "Remarks on Similarities Among Ternary Bent Functions",
    	booktitle = "2019 {IEEE} 49th International Symposium on Multiple-Valued Logic (ISMVL), Fredericton, NB, Canada, May 21-23, 2019",
    	pages = "79--84",
    	publisher = "{IEEE}",
    	year = 2019,
    	url = "https://doi.org/10.1109/ISMVL.2019.00022",
    	doi = "10.1109/ISMVL.2019.00022",
    	timestamp = "Wed, 16 Oct 2019 14:14:57 +0200",
    	biburl = "https://dblp.org/rec/conf/ismvl/StankovicSAM19.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }