JELIA 2025: 19TH EUROPEAN CONFERENCE ON LOGICS IN ARTIFICIAL INTELLIGENCE

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

Disclaimer | Powered by EasyChair Smart Program