Abstract is missing.
- Generative Datalog and Answer Set Programming - Extended AbstractMario Alviano. 3-10 [doi]
- Eℒ RevisitedFranz Baader, Patrick Koopmann, Francesco Kriegel. 11-34 [doi]
- Excursions in First-Order Logic and Probability: Infinitely Many Random Variables, Continuous Distributions, Recursive Programs and BeyondVaishak Belle. 35-46 [doi]
- Efficient Computation of Shap Explanation Scores for Neural Network Classifiers via Knowledge CompilationLeopoldo E. Bertossi, Jorge E. Leon. 49-64 [doi]
- Logic, Accountability and Design: Extended AbstractPedro Cabalar, David Pearce 0001. 65-72 [doi]
- Contrastive Explanations for Answer-Set ProgramsThomas Eiter, Tobias Geibinger, Johannes Oetsch. 73-89 [doi]
- Short Boolean Formulas as Explanations in PracticeReijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander. 90-105 [doi]
- A New Class of Explanations for Classifiers with Non-binary FeaturesChunxi Ji, Adnan Darwiche. 106-122 [doi]
- Stable Normative Explanations: From Argumentation to Deontic LogicCecilia Di Florio, Antonino Rotolo, Guido Governatori, Giovanni Sartor. 123-131 [doi]
- Declarative Reasoning on Explanations Using Constraint Logic ProgrammingLaura State, Salvatore Ruggieri, Franco Turini. 132-141 [doi]
- On the Expressive Power of Assumption-Based ArgumentationMatti Berthold, Anna Rapberger, Markus Ulbricht 0001. 145-160 [doi]
- Weak Argumentation Semantics and Unsafe Odd Cycles: Results and a ConjectureSjur K. Dyrkolbotn. 161-175 [doi]
- Computing Stable Extensions of Argumentation Frameworks using Formal Concept AnalysisSergei Obiedkov, Baris Sertkaya. 176-191 [doi]
- Reasoning in Assumption-Based Argumentation Using Tree-DecompositionsAndrei Popescu 0005, Johannes Peter Wallner. 192-208 [doi]
- A Principle-Based Analysis of Bipolar Argumentation SemanticsLiuwen Yu, Caren Al Anaissy, Srdjan Vesic, Xu Li, Leendert van der Torre. 209-224 [doi]
- Comparing Planning Domain Models Using Answer Set ProgrammingLukás Chrpa, Carmine Dodaro, Marco Maratea, Marco Mochi, Mauro Vallati. 227-242 [doi]
- Hybrid ASP-Based Multi-objective Scheduling of Semiconductor Manufacturing ProcessesMohammed M. S. El-Kholany, Ramsha Ali, Martin Gebser. 243-252 [doi]
- On Heuer's Procedure for Verifying Strong EquivalenceJorge Fandinno, Vladimir Lifschitz. 253-261 [doi]
- Hamiltonian Cycle Reconfiguration with Answer Set ProgrammingTakahiro Hirate, Mutsunori Banbara, Katsumi Inoue, Xiao-Nan Lu, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura. 262-277 [doi]
- Recongo: Bounded Combinatorial Reconfiguration with Answer Set ProgrammingYuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub. 278-286 [doi]
- sf reg: Exploring Non-Regular Extensions of PDL with Description Logics FeaturesBartosz Bednarczyk. 289-305 [doi]
- Non-Normal Modal Description LogicsTiziano Dalmonte, Andrea Mazzullo, Ana Ozaki, Nicolas Troquard. 306-321 [doi]
- First Steps Towards Taming Description Logics with StringsStéphane Demri, Karin Quaas. 322-337 [doi]
- Merge, Explain, Iterate: A Combination of MHS and MXP in an ABox Abduction SolverMartin Homola, Júlia Pukancová, Janka Boborová, Iveta Balintová. 338-352 [doi]
- Tractable Closure-Based Possibilistic Repair for Partially Ordered DL-Lite OntologiesAhmed Laouar, Sihem Belabbes, Salem Benferhat. 353-368 [doi]
- Derivation-Graph-Based Characterizations of Decidable Existential Rule SetsTim S. Lyon, Sebastian Rudolph. 369-384 [doi]
- Concept Combination in Weighted DLGuendalina Righetti, Pietro Galliani, Claudio Masolo. 385-401 [doi]
- How Easy it is to Know How: An Upper Bound for the Satisfiability ProblemCarlos Areces, Valentin Cassano, Pablo F. Castro, Raul Fervari, Andrés R. Saravia. 405-419 [doi]
- Non-standard Modalities in Paraconsistent Gödel LogicMarta Bílková, Sabine Frittella, Daniil Kozhemiachenko. 420-436 [doi]
- Base-Based Model Checking for Multi-agent only BelievingTiago De Lima, Emiliano Lorini, François Schwarzentruber. 437-445 [doi]
- Belief ReconfigurationSébastien Konieczny, Elise Perrotin, Ramón Pino Pérez. 446-461 [doi]
- Splitting Techniques for Conditional Belief Bases in the Context of c-RepresentationsMarco Wilhelm, Meliha Sezgin, Gabriele Kern-Isberner, Jonas Haldimann, Christoph Beierle, Jesse Heyninck. 462-477 [doi]
- Complexity and Scalability of Defeasible Reasoning with Typicality in Many-Valued Weighted Knowledge BasesMario Alviano, Laura Giordano 0001, Daniele Theseider Dupré. 481-497 [doi]
- Deontic Equilibrium Logic with eXplicit NegationPedro Cabalar, Agata Ciabattoni, Leendert van der Torre. 498-514 [doi]
- Categorical Approximation Fixpoint TheoryAngelos Charalambidis, Panos Rondogiannis. 515-530 [doi]
- Deciding Subsumption in Defeasible $\mathcal {ELI}_\bot $ with Typicality ModelsIgor de Camargo e Souza Câmara, Anni-Yasmin Turhan. 531-546 [doi]
- Truth and Preferences - A Game Approach for Qualitative Choice LogicRobert Freiman, Michael Bernreiter. 547-560 [doi]
- Rational Closure Extension in SPO-Representable Inductive Inference OperatorsJonas Haldimann, Thomas Meyer 0002, Gabriele Kern-Isberner, Christoph Beierle. 561-576 [doi]
- delphic: Practical DEL Planning via PossibilitiesAlessandro Burigana, Paolo Felli, Marco Montali. 579-594 [doi]
- Enhancing Temporal Planning by Sequential Macro-ActionsMarco De Bortoli, Lukás Chrpa, Martin Gebser, Gerald Steinbauer-Wagner. 595-604 [doi]
- Planning with Partial Observability by SATSaurabh Fadnis, Jussi Rintanen. 605-620 [doi]
- Optimal Planning with Expressive Action Languages as Constraint OptimizationEnrico Giunchiglia, Armando Tacchella. 621-637 [doi]
- Plan Selection Framework for Policy-Aware Autonomous AgentsCharles Harders, Daniela Inclezan. 638-646 [doi]
- Strongly Complete Axiomatization for a Logic with Probabilistic Interventionist CounterfactualsFausto Barbero, Jonni Virtema. 649-664 [doi]
- Logics with Probabilistic Team Semantics and the Boolean NegationMiika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood 0002, Arne Meier, Jonni Virtema. 665-680 [doi]
- Formalizing Statistical Causality via Modal LogicYusuke Kawamoto 0001, Tetsuya Sato 0001, Kohei Suenaga. 681-696 [doi]
- Boosting Definability Bipartition Computation Using SAT WitnessesJean-Marie Lagniez, Pierre Marquis. 697-711 [doi]
- Hybrid Modal Operators for Definite DescriptionsPrzemyslaw Andrzej Walega, Michal Zawidzki. 712-726 [doi]
- Data Graphs with Incomplete Information (and a Way to Complete Them)Carlos Areces, Valentin Cassano, Danae Dutto, Raul Fervari. 729-744 [doi]
- Computing MUS-Based Inconsistency MeasuresIsabelle Kuhlmann, Andreas Niskanen, Matti Järvisalo. 745-755 [doi]
- Towards Systematic Treatment of Partial Functions in Knowledge RepresentationDjordje Markovic, Maurice Bruynooghe, Marc Denecker. 756-770 [doi]
- Deterministic Weighted Automata Under Partial ObservabilityJakub Michaliszyn, Jan Otop. 771-784 [doi]
- Past-Present Temporal Programs over Finite TracesPedro Cabalar, Martín Diéguez, François Laferrière, Torsten Schaub. 787-795 [doi]
- Robust Alternating-Time Temporal LogicAniello Murano, Daniel Neider, Martin Zimmermann 0002. 796-813 [doi]
- The Universal Tangle for Spatial ReasoningDavid Fernández Duque, Konstnatinos Papafilippou. 814-827 [doi]