JELIA 2025

Accepted Papers

  • Agata Ciabattoni, Dmitry Rozplokhas and Matteo Tesi. GL-based calculi for PCL and its deontic cousin
  • Ahmed Laouar and Salem Benferhat. Closure-Based Tractable Possibilistic Inference from Partially Ordered DL-Lite Ontologies
  • Andrea Cuteri, Giuseppe Mazzotta and Francesco Ricca. Lazy Atom Discovery in Compilation-Based ASP Solving
  • Andreas Plank, Clemens Hofstadler, Maximilian Heisinger and Martina Seidl. Refinement-Based Enumeration of QBF Solutions
  • Andrei Popescu and Johannes P. Wallner. Completing Structured Arguments in Assumption-based Argumentation
  • Andrew Lewis-Smith and Zhiguang Zhao. A Kripke Semantics for Intuitionistic Lukasiewicz Logic with Weak Excluded Middle
  • Andrzej Indrzejczak, Przemysław Andrzej Wałęga and Michal Zawidzki. On Temporal References via Definite Descriptions in First-Order Monadic Logic of Order
  • Benjamin Bordais and Daniel Neider. A framework for computing upper bounds in passive learning settings
  • Christoph Beierle, Jonas Philipp Haldimann, Arthur Sanin, Aron Spang, Lars-Phillip Spiegel and Martin von Berg. The InfOCF Library for Reasoning With Conditional Belief Bases
  • Christoph Jabs, Jeremias Berg and Matti Järvisalo. Engineering and Evaluating Multi-objective Pseudo-boolean Optimizers
  • Davide Soldà and Thomas Eiter. deon-B: A language for Well-Founded Deontic Planning
  • Francesco Chiariello and Joao Marques-Silva. Formal Explanations of Black-Box Ranking Functions
  • Gregor Behnke, David Speck and Daniel Gnad. AxSAT - Bringing Axioms to SAT Planning
  • Jakub Michaliszyn. Alternating-Time Temporal Logic with Default Actions
  • Jean Marie Lagniez and Emmanuel Lonca. Enhancing Query Efficiency for d-DNNF Representations Through Preprocessing
  • Joanna Golińska-Pilarek, Taneli Huuskonen and Michał Zawidzki. Deciding Non-Fregean Identities: A Dual Tableau Approach
  • Jonas Philipp Haldimann, Magdalena Ortiz and Mantas Šimkus. Towards Practicable Defeasible Reasoning for ABoxes
  • Kai Sauerwald, Kenneth Skiba, Eduardo Fermé and Thomas Meyer. Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback
  • Leila Amgoud. On the Sensitivity of Extension Semantics to Similarity
  • Lucas Van Laer, Simon Vandevelde and Joost Vennekens. DIRT: a Literature-Based Benchmark Suite for Grounders
  • Luciano Caroprese, Ester Zumpano and Domenico Ursino. Reinforcement Learning Meets Logic Programming: Towards Explainable AI
  • Matilda Häggblom. Inclusion with repetitions and Boolean constants -- implication problems revisited
  • Nicholas Leisegang, Thomas Meyer and Ivan Varzinczak. Extending Defeasibility for Propositional Standpoint Logics
  • Noah Collinet, Yakoub Salhi and Souhila Kaci. On Extracting Legal Arguments
  • Pablo Martínez-Naredo, Raúl Mencía, Joao Marques-Silva and Carlos Mencía. Explanations of Unsatisfiability Beyond Minimal Subsets
  • Peter Pfeiffer, Daniel Grosse and Martina Seidl. Refined Notions of QBF Equivalences
  • Pietro Galliani. Strongly First Order Disjunctive Embedded Dependencies in Team Semantics
  • Piotr Wojciechowski and K. Subramani. Finding short tree-like unit refutations in UTVPI Constraint Systems
  • Reijo Jaakkola, Antti Kuusisto, Miikka Vilander, Tobias Geibinger and Xinghan Liu. Why this and not that? A Logic-based Framework for Contrastive Explanations
  • Rodrigo Raya and Christophe Ringeissen. Interpolating Parametric Array Theories
  • Simon Lutz, Daniil Kaminskyi, Florian Wittbold, Simon Dierl, Falk Howar, Barbara König, Emmanuel Müller and Daniel Neider. Unsupervised Automata Learning via Discrete Optimization
  • Tommaso Flaminio, Lluis Godo, Ramon Pino Perez and Lluis Subirana. Lockean beliefs that are deductively closed and minimal change
  • Uri Andrews and Luca San Mauro. Comparing Dialectical Systems: Contradiction and Counterexample in Iterated Belief Revision
  • Uri Andrews and Luca San Mauro. SCC-recursiveness in infinite argumentation
  • Vaishak Belle and Pablo Barcelo. A Uniform Language for Safety, Robustness and Explainability
  • Vincent de Wit, Aleks Knoks and Leendert van der Torre. Dual Scale Detachment
  • Vladimir Lifschitz. An Experiment with Anthem: Semantic Equivalence of Tiling Programs
  • Vladimir Lifschitz. Generalizing the Syntax of Terms in Mini-gringo
  • Wolfgang Faber and Michael Morak. Encoding Action Reversibility In Planning Using Quantified ASP and Bule
  • Yaroslav Petrukhin. On a Second-Order Version of Russellian Theory of Definite Descriptions
  • Yiheng Wang. From Modal Ockham Algebras to Modal Berman Variety: Relational Semantics and Kripke-Completeness
  • Yini Huang, Beishui Liao and Xingchi Su. Exposure and Hiding: Approaching the Objective Probability and Hiding the Secret in Zero-Knowledge Proof
  • Zhifei Zheng, Sami Cherif, Rui Shibasaki, Chu-Min Li and Jialu Zhang. Exact Approaches for the Diverse Satisfiability Problem
  • Zhifei Zheng, Sami Cherif, Rui Shibasaki, Chu-Min Li and Jialu Zhang. Maximum Satisfiability Formulations for Nonlinear Integer Programming