default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th JELIA 2025: Kutaisi, Georgia - Part I
- Giovanni Casini
, Besik Dundua, Temur Kutsia:
Logics in Artificial Intelligence - 19th European Conference, JELIA 2025, Kutaisi, Georgia, September 1-4, 2025, Proceedings, Part I. Lecture Notes in Computer Science 16093, Springer 2026, ISBN 978-3-032-04586-7
Special Track: Logics for Explainable and Trustworthy AI
- Vaishak Belle, Pablo Barceló:
A Uniform Language for Safety, Robustness and Explainability. 3-12 - Luciano Caroprese, Ester Zumpano, Domenico Ursino:
Reinforcement Learning Meets Logic Programming: Towards Explainable AI. 13-27 - Francesco Chiariello, João Marques-Silva:
Formal Explanations of Black-Box Ranking Functions. 28-44 - Tobias Geibinger, Reijo Jaakkola, Antti Kuusisto, Xinghan Liu, Miikka Vilander:
Why This and Not That? A Logic-Based Framework for Contrastive Explanations. 45-60
Argumentation
- Leila Amgoud:
On the Sensitivity of Extension Semantics to Similarity. 63-77 - Uri Andrews, Luca San Mauro:
SCC-Recursiveness in Infinite Argumentation. 78-94 - Andrei Popescu, Johannes Peter Wallner:
Completing Structured Arguments in Assumption-Based Argumentation. 95-111
Constraint Satisfaction and Optimization
- Christoph Jabs, Jeremias Berg, Matti Järvisalo:
Engineering and Evaluating Multi-objective Pseudo-Boolean Optimizers. 115-134 - Simon Lutz, Daniil Kaminskyi, Florian Wittbold, Simon Dierl, Falk Howar, Barbara König, Emmanuel Müller, Daniel Neider:
Unsupervised Automata Learning via Discrete Optimization. 135-153 - Piotr Wojciechowski, K. Subramani:
Finding Short Tree-Like Unit Refutations in UTVPI Constraint Systems. 154-167
Deontic Reasoning
- Agata Ciabattoni, Dmitry Rozplokhas, Matteo Tesi:
GL-Based Calculi for PCL and Its Deontic Cousin. 171-186 - Davide Soldà, Thomas Eiter:
deon-B: A Language for Well-Founded Deontic Planning. 187-204 - Vincent de Wit, Aleks Knoks, Leendert van der Torre:
Dual Scale Detachment. 205-219
Description Logics and Ontological Reasoning
- Jonas Haldimann, Magdalena Ortiz, Mantas Simkus:
Towards Practicable Defeasible Reasoning for ABoxes. 223-239 - Ahmed Laouar, Salem Benferhat:
Closure-Based Tractable Possibilistic Inference from Partially Ordered DL-Lite Ontologies. 240-256
Higher-order and Non-classical Logics
- Pietro Galliani:
Strongly First Order Disjunctive Embedded Dependencies in Team Semantics. 259-274 - Andrew Lewis-Smith, Zhiguang Zhao:
A Kripke Semantics for Intuitionistic Łukasiewicz Logic with Weak Excluded Middle. 275-289 - Yiheng Wang:
From Modal Ockham Algebras to Modal Berman Variety: Relational Semantics and Kripke-Completeness. 290-305
Logic Programming and Answer Set Programming
- Andrea Cuteri, Giuseppe Mazzotta, Francesco Ricca:
Lazy Atom Discovery in Compilation-Based ASP Solving. 309-326 - Wolfgang Faber, Michael Morak:
Encoding Action Reversibility In Planning Using Quantified ASP and Bule. 327-342 - Lucas Van Laer, Simon Vandevelde, Joost Vennekens:
DIRT: a Literature-Based Benchmark Suite for Grounders. 343-356 - Vladimir Lifschitz:
An Experiment with Anthem: Semantic Equivalence of Tiling Programs. 357-363 - Vladimir Lifschitz:
Generalizing the Syntax of Terms in Mini-gringo. 364-377
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 2025-10-09 22:36 CEST 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:
