default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJELIA 2023: Dresden, Germany
- Sarah Alice Gaggl
, Maria Vanina Martinez, Magdalena Ortiz:
Logics in Artificial Intelligence - 18th European Conference, JELIA 2023, Dresden, Germany, September 20-22, 2023, Proceedings. Lecture Notes in Computer Science 14281, Springer 2023, ISBN 978-3-031-43618-5
Invited Papers
- Mario Alviano:
Generative Datalog and Answer Set Programming - Extended Abstract. 3-10 - Franz Baader, Patrick Koopmann, Francesco Kriegel:
Optimal Repairs in the Description Logic Eℒ Revisited. 11-34 - Vaishak Belle:
Excursions in First-Order Logic and Probability: Infinitely Many Random Variables, Continuous Distributions, Recursive Programs and Beyond. 35-46
Special Track: Logics for Explainable and Trustworthy AI
- Leopoldo E. Bertossi, Jorge E. Leon:
Efficient Computation of Shap Explanation Scores for Neural Network Classifiers via Knowledge Compilation. 49-64 - Pedro Cabalar, David Pearce:
Logic, Accountability and Design: Extended Abstract. 65-72 - Thomas Eiter, Tobias Geibinger, Johannes Oetsch:
Contrastive Explanations for Answer-Set Programs. 73-89 - Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Short Boolean Formulas as Explanations in Practice. 90-105 - Chunxi Ji, Adnan Darwiche:
A New Class of Explanations for Classifiers with Non-binary Features. 106-122 - Cecilia Di Florio, Antonino Rotolo, Guido Governatori, Giovanni Sartor:
Stable Normative Explanations: From Argumentation to Deontic Logic. 123-131 - Laura State, Salvatore Ruggieri, Franco Turini:
Declarative Reasoning on Explanations Using Constraint Logic Programming. 132-141
Argumentation
- Matti Berthold, Anna Rapberger, Markus Ulbricht:
On the Expressive Power of Assumption-Based Argumentation. 145-160 - Sjur K. Dyrkolbotn:
Weak Argumentation Semantics and Unsafe Odd Cycles: Results and a Conjecture. 161-175 - Sergei Obiedkov, Baris Sertkaya:
Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis. 176-191 - Andrei Popescu, Johannes Peter Wallner:
Reasoning in Assumption-Based Argumentation Using Tree-Decompositions. 192-208 - Liuwen Yu, Caren Al Anaissy, Srdjan Vesic, Xu Li, Leendert van der Torre:
A Principle-Based Analysis of Bipolar Argumentation Semantics. 209-224
Answer Set Programming
- Lukás Chrpa, Carmine Dodaro, Marco Maratea, Marco Mochi, Mauro Vallati:
Comparing Planning Domain Models Using Answer Set Programming. 227-242 - Mohammed M. S. El-Kholany, Ramsha Ali, Martin Gebser:
Hybrid ASP-Based Multi-objective Scheduling of Semiconductor Manufacturing Processes. 243-252 - Jorge Fandinno, Vladimir Lifschitz:
On Heuer's Procedure for Verifying Strong Equivalence. 253-261 - Takahiro Hirate, Mutsunori Banbara, Katsumi Inoue, Xiao-Nan Lu, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura:
Hamiltonian Cycle Reconfiguration with Answer Set Programming. 262-277 - Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub:
Recongo: Bounded Combinatorial Reconfiguration with Answer Set Programming. 278-286
Description Logics and Ontological Reasoning
- Bartosz Bednarczyk:
Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features. 289-305 - Tiziano Dalmonte, Andrea Mazzullo, Ana Ozaki, Nicolas Troquard:
Non-Normal Modal Description Logics. 306-321 - Stéphane Demri, Karin Quaas:
First Steps Towards Taming Description Logics with Strings. 322-337 - Martin Homola, Júlia Pukancová, Janka Boborová, Iveta Balintová:
Merge, Explain, Iterate: A Combination of MHS and MXP in an ABox Abduction Solver. 338-352 - Ahmed Laouar, Sihem Belabbes, Salem Benferhat:
Tractable Closure-Based Possibilistic Repair for Partially Ordered DL-Lite Ontologies. 353-368 - Tim S. Lyon, Sebastian Rudolph:
Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets. 369-384 - Guendalina Righetti, Pietro Galliani, Claudio Masolo:
Concept Combination in Weighted DL. 385-401
Logics of Knowledge and Belief
- Carlos Areces, Valentin Cassano, Pablo F. Castro, Raul Fervari, Andrés R. Saravia:
How Easy it is to Know How: An Upper Bound for the Satisfiability Problem. 405-419 - Marta Bílková, Sabine Frittella, Daniil Kozhemiachenko:
Non-standard Modalities in Paraconsistent Gödel Logic. 420-436 - Tiago de Lima, Emiliano Lorini, François Schwarzentruber:
Base-Based Model Checking for Multi-agent only Believing. 437-445 - Sébastien Konieczny, Elise Perrotin, Ramón Pino Pérez:
Belief Reconfiguration. 446-461 - Marco Wilhelm, Meliha Sezgin, Gabriele Kern-Isberner, Jonas Haldimann, Christoph Beierle, Jesse Heyninck:
Splitting Techniques for Conditional Belief Bases in the Context of c-Representations. 462-477
Non-monotonic Reasoning
- Mario Alviano, Laura Giordano, Daniele Theseider Dupré:
Complexity and Scalability of Defeasible Reasoning with Typicality in Many-Valued Weighted Knowledge Bases. 481-497 - Pedro Cabalar, Agata Ciabattoni, Leendert van der Torre:
Deontic Equilibrium Logic with eXplicit Negation. 498-514 - Angelos Charalambidis, Panos Rondogiannis:
Categorical Approximation Fixpoint Theory. 515-530 - Igor de Camargo e Souza Câmara, Anni-Yasmin Turhan:
Deciding Subsumption in Defeasible $\mathcal {ELI}_\bot $ with Typicality Models. 531-546 - Robert Freiman, Michael Bernreiter:
Truth and Preferences - A Game Approach for Qualitative Choice Logic. 547-560 - Jonas Haldimann, Thomas Meyer, Gabriele Kern-Isberner, Christoph Beierle:
Rational Closure Extension in SPO-Representable Inductive Inference Operators. 561-576
Planning
- Alessandro Burigana, Paolo Felli, Marco Montali:
delphic: Practical DEL Planning via Possibilities. 579-594 - Marco De Bortoli, Lukás Chrpa, Martin Gebser, Gerald Steinbauer-Wagner:
Enhancing Temporal Planning by Sequential Macro-Actions. 595-604 - Saurabh Fadnis, Jussi Rintanen:
Planning with Partial Observability by SAT. 605-620 - Enrico Giunchiglia, Armando Tacchella:
Optimal Planning with Expressive Action Languages as Constraint Optimization. 621-637 - Charles Harders, Daniela Inclezan:
Plan Selection Framework for Policy-Aware Autonomous Agents. 638-646
Reasoning About Causes and Dependencies
- Fausto Barbero, Jonni Virtema:
Strongly Complete Axiomatization for a Logic with Probabilistic Interventionist Counterfactuals. 649-664 - Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema:
Logics with Probabilistic Team Semantics and the Boolean Negation. 665-680 - Yusuke Kawamoto, Tetsuya Sato, Kohei Suenaga:
Formalizing Statistical Causality via Modal Logic. 681-696 - Jean-Marie Lagniez, Pierre Marquis:
Boosting Definability Bipartition Computation Using SAT Witnesses. 697-711 - Przemyslaw Andrzej Walega, Michal Zawidzki:
Hybrid Modal Operators for Definite Descriptions. 712-726
Reasoning About Quantities and Functions
- Carlos Areces, Valentin Cassano, Danae Dutto, Raul Fervari:
Data Graphs with Incomplete Information (and a Way to Complete Them). 729-744 - Isabelle Kuhlmann, Andreas Niskanen, Matti Järvisalo:
Computing MUS-Based Inconsistency Measures. 745-755 - Djordje Markovic, Maurice Bruynooghe, Marc Denecker:
Towards Systematic Treatment of Partial Functions in Knowledge Representation. 756-770 - Jakub Michaliszyn, Jan Otop:
Deterministic Weighted Automata Under Partial Observability. 771-784
Temporal and Spatial Reasoning
- Pedro Cabalar, Martín Diéguez, François Laferrière, Torsten Schaub:
Past-Present Temporal Programs over Finite Traces. 787-795 - Aniello Murano, Daniel Neider, Martin Zimmermann:
Robust Alternating-Time Temporal Logic. 796-813 - David Fernández-Duque, Konstantinos Papafilippou:
The Universal Tangle for Spatial Reasoning. 814-827
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-11 21:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
