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

This page contains an index consisting of author-provided keywords.

(
(Counter-)Model Counting	Refinement-Based Enumeration of QBF Solutions
(Counter-)Model Enumeration	Refinement-Based Enumeration of QBF Solutions
A
action reversibility	Encoding Action Reversibility In Planning Using Quantified ASP and Bule
analytic tableaux	Deciding Non-Fregean Identities: A Dual Tableau Approach
answer set programming	Lazy Atom Discovery in Compilation-Based ASP Solving Generalizing the Syntax of Terms in Mini-gringo Completing Structured Arguments in Assumption-based Argumentation Why this and not that? A Logic-based Framework for Contrastive Explanations An Experiment with Anthem: Semantic Equivalence of Tiling Programs
Argument extraction	On Extracting Legal Arguments
argumentation	On the Sensitivity of Extension Semantics to Similarity Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback
Automata Learning	Unsupervised Automata Learning via Discrete Optimization
automated reasoning	An Experiment with Anthem: Semantic Equivalence of Tiling Programs
Axiomatization	Inclusion with repetitions and Boolean constants -- implication problems revisited
B
balancing scale	Dual Scale Detachment
belief base	The InfOCF Library for Reasoning With Conditional Belief Bases
Belief change	Lockean beliefs that are deductively closed and minimal change
belief revision	It is Possible! Distance Semantics for Modal Belief Revision
Benchmark	DIRT: a Literature-Based Benchmark Suite for Grounders
Boolean inclusion	Inclusion with repetitions and Boolean constants -- implication problems revisited
boolean ML model	A Uniform Language for Safety, Robustness and Explainability
C
c-inference	The InfOCF Library for Reasoning With Conditional Belief Bases
Case-based reasoning	On Extracting Legal Arguments
certified optimization	Engineering and Evaluating Multi-objective Pseudo-boolean Optimizers
cf2	SCC-recursiveness in infinite argumentation
choice	Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback
choice semantics	Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback
classical planning	AxSAT - Bringing Axioms to SAT Planning
Compiled Propagators	Lazy Atom Discovery in Compilation-Based ASP Solving
completeness	Deciding Non-Fregean Identities: A Dual Tableau Approach
completing arguments	Completing Structured Arguments in Assumption-based Argumentation
computational argumentation	Completing Structured Arguments in Assumption-based Argumentation
Computational complexity	Inclusion with repetitions and Boolean constants -- implication problems revisited
conditional	The InfOCF Library for Reasoning With Conditional Belief Bases
conditional logic	GL-based calculi for PCL and its deontic cousin
Contrastive Explanations	Why this and not that? A Logic-based Framework for Contrastive Explanations
countermodel construction	GL-based calculi for PCL and its deontic cousin
Cut admissibility	On a Second-Order Version of Russellian Theory of Definite Descriptions
D
Data Repairs	Closure-Based Tractable Possibilistic Inference from Partially Ordered DL-Lite Ontologies
decision procedure	Deciding Non-Fregean Identities: A Dual Tableau Approach
Decision-DNNF	Enhancing Query Efficiency for d-DNNF Representations Through Preprocessing
Deductive closure	Lockean beliefs that are deductively closed and minimal change
Defeasible modalities	Extending Defeasibility for Propositional Standpoint Logics
Defeasible rules	Towards Practicable Defeasible Reasoning for ABoxes
Definite descriptions	On Temporal References via Definite Descriptions in First-Order Monadic Logic of Order On a Second-Order Version of Russellian Theory of Definite Descriptions
deontic logic	Dual Scale Detachment GL-based calculi for PCL and its deontic cousin
Deontic Planning	deon-B: A language for Well-Founded Deontic Planning
Deontic Reasoning	deon-B: A language for Well-Founded Deontic Planning
Description logics	Towards Practicable Defeasible Reasoning for ABoxes
detachment systems	Dual Scale Detachment
dialectical systems	Comparing Dialectical Systems: Contradiction and Counterexample in Iterated Belief Revision
Direct access	Enhancing Query Efficiency for d-DNNF Representations Through Preprocessing
discrete duality	From Modal Ockham Algebras to Modal Berman Variety: Relational Semantics and Kripke-Completeness
Discrete Optimization	Unsupervised Automata Learning via Discrete Optimization
Diverse Satisfiability	Exact Approaches for the Diverse Satisfiability Problem
dual tableaux	Deciding Non-Fregean Identities: A Dual Tableau Approach
E
empirical evaluation	Engineering and Evaluating Multi-objective Pseudo-boolean Optimizers
Encodings	Maximum Satisfiability Formulations for Nonlinear Integer Programming
epistemic spaces	Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback
Equivalence Checking	Refined Notions of QBF Equivalences
Explainable AI	Reinforcement Learning Meets Logic Programming: Towards Explainable AI Why this and not that? A Logic-based Framework for Contrastive Explanations
Explainable Artificial Intelligence	Formal Explanations of Black-Box Ranking Functions
Extension Semantics	On the Sensitivity of Extension Semantics to Similarity
F
fairness	A Uniform Language for Safety, Robustness and Explainability
formal verification	Exposure and Hiding: Approaching the Objective Probability and Hiding the Secret in Zero-Knowledge Proof
G
Grounding	DIRT: a Literature-Based Benchmark Suite for Grounders
Grounding Bottleneck	Lazy Atom Discovery in Compilation-Based ASP Solving
H
Higher-Order Logic	Strongly First Order Disjunctive Embedded Dependencies in Team Semantics
I
implementations	The InfOCF Library for Reasoning With Conditional Belief Bases
Implication problem	Inclusion with repetitions and Boolean constants -- implication problems revisited
Inclusion dependency	Inclusion with repetitions and Boolean constants -- implication problems revisited
incomplete	Finding short tree-like unit refutations in UTVPI Constraint Systems
Inconsistency	Closure-Based Tractable Possibilistic Inference from Partially Ordered DL-Lite Ontologies
infinite argumentation	SCC-recursiveness in infinite argumentation
intermediate logic	A Kripke Semantics for Intuitionistic Lukasiewicz Logic with Weak Excluded Middle
interpolation	Interpolating Parametric Array Theories
iterated belief revision	Comparing Dialectical Systems: Contradiction and Counterexample in Iterated Belief Revision
K
Knowledge Graphs	Tackling Semantics-Aware Machine Learning and Explanations for Knowledge Graph Refinement
Knowledge Representation and Reasoning	DIRT: a Literature-Based Benchmark Suite for Grounders
Kripke semantics	A Kripke Semantics for Intuitionistic Lukasiewicz Logic with Weak Excluded Middle
Kripke-completeness	From Modal Ockham Algebras to Modal Berman Variety: Relational Semantics and Kripke-Completeness
L
Lambda-abstraction	On a Second-Order Version of Russellian Theory of Definite Descriptions
learned behaviour	Logic for Safe Reinforcement Learning
Legal case databases	On Extracting Legal Arguments
lexicographic inference	The InfOCF Library for Reasoning With Conditional Belief Bases
limiting belief sets	Comparing Dialectical Systems: Contradiction and Counterexample in Iterated Belief Revision
Linear Programming	Exact Approaches for the Diverse Satisfiability Problem
Lockean thesis	Lockean beliefs that are deductively closed and minimal change
Logic	Why this and not that? A Logic-based Framework for Contrastive Explanations
logic	Logic for Safe Reinforcement Learning
Logic Programming	Reinforcement Learning Meets Logic Programming: Towards Explainable AI Encoding Action Reversibility In Planning Using Quantified ASP and Bule
M
Machine Learning	Formal Explanations of Black-Box Ranking Functions Tackling Semantics-Aware Machine Learning and Explanations for Knowledge Graph Refinement
Maximum Satisfiability	Exact Approaches for the Diverse Satisfiability Problem Maximum Satisfiability Formulations for Nonlinear Integer Programming
MaxSAT solver	The InfOCF Library for Reasoning With Conditional Belief Bases
measures of importance	Explanations of Unsatisfiability Beyond Minimal Subsets
minimal change	It is Possible! Distance Semantics for Modal Belief Revision
Minimal revision	Lockean beliefs that are deductively closed and minimal change
modal Berman variety	From Modal Ockham Algebras to Modal Berman Variety: Relational Semantics and Kripke-Completeness
modal logic	It is Possible! Distance Semantics for Modal Belief Revision
Modal logics	Extending Defeasibility for Propositional Standpoint Logics
modal Ockham algebra	From Modal Ockham Algebras to Modal Berman Variety: Relational Semantics and Kripke-Completeness
model checking	Alternating-Time Temporal Logic with Default Actions
Model enumeration	Enhancing Query Efficiency for d-DNNF Representations Through Preprocessing
model theory	Interpolating Parametric Array Theories
Multi-objective optimization	Engineering and Evaluating Multi-objective Pseudo-boolean Optimizers
multiagent logic	Alternating-Time Temporal Logic with Default Actions
N
Neuro-symbolic system	Reinforcement Learning Meets Logic Programming: Towards Explainable AI
Non-Classical Logic	Strongly First Order Disjunctive Embedded Dependencies in Team Semantics
Non-monotonic reasoning	Extending Defeasibility for Propositional Standpoint Logics
Nonlinear Integer Programming	Maximum Satisfiability Formulations for Nonlinear Integer Programming
Nonmonotonic reasoning	Towards Practicable Defeasible Reasoning for ABoxes The InfOCF Library for Reasoning With Conditional Belief Bases
O
Ontologies	Closure-Based Tractable Possibilistic Inference from Partially Ordered DL-Lite Ontologies
optimal-length	Finding short tree-like unit refutations in UTVPI Constraint Systems
P
p-entailemnt	The InfOCF Library for Reasoning With Conditional Belief Bases
Partial Orders	Closure-Based Tractable Possibilistic Inference from Partially Ordered DL-Lite Ontologies
Passive learning	A framework for computing upper bounds in passive learning settings
planning as SAT	AxSAT - Bringing Axioms to SAT Planning
Polynomials	Maximum Satisfiability Formulations for Nonlinear Integer Programming
Preferences	Formal Explanations of Black-Box Ranking Functions
Preferential semantics	Extending Defeasibility for Propositional Standpoint Logics
Preprocessing techniques	Enhancing Query Efficiency for d-DNNF Representations Through Preprocessing
principle-based analysis	Dual Scale Detachment
Probabilistic Hoare Logic	Exposure and Hiding: Approaching the Objective Probability and Hiding the Secret in Zero-Knowledge Proof
Problem Modeling	On Extracting Legal Arguments
Proof theory	On a Second-Order Version of Russellian Theory of Definite Descriptions
Propositional Satisfiability	On Extracting Legal Arguments
provability logic	GL-based calculi for PCL and its deontic cousin
pseudo-Boolean optimization	Engineering and Evaluating Multi-objective Pseudo-boolean Optimizers
Python library	The InfOCF Library for Reasoning With Conditional Belief Bases
Q
QBF	Refinement-Based Enumeration of QBF Solutions Refined Notions of QBF Equivalences
QBF Solutions	Refined Notions of QBF Equivalences
Quadratic Integer Programming	Exact Approaches for the Diverse Satisfiability Problem
quantified boolean formulas	Encoding Action Reversibility In Planning Using Quantified ASP and Bule
R
Ranking	Formal Explanations of Black-Box Ranking Functions
Reasoning with data	Towards Practicable Defeasible Reasoning for ABoxes
reasons	Dual Scale Detachment
refinement	Tackling Semantics-Aware Machine Learning and Explanations for Knowledge Graph Refinement
refutations	Finding short tree-like unit refutations in UTVPI Constraint Systems
Reinforcement Learning	Reinforcement Learning Meets Logic Programming: Towards Explainable AI
Reinforcement learning	Logic for Safe Reinforcement Learning
restricted choice	Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback
robust strategies	Alternating-Time Temporal Logic with Default Actions
robustness	A Uniform Language for Safety, Robustness and Explainability
S
safety	A Uniform Language for Safety, Robustness and Explainability
SAT	AxSAT - Bringing Axioms to SAT Planning
SAT solver	The InfOCF Library for Reasoning With Conditional Belief Bases
SAT-based approach	Explanations of Unsatisfiability Beyond Minimal Subsets
satisfiability modulo theories	Interpolating Parametric Array Theories
SCC-recursiveness	SCC-recursiveness in infinite argumentation
Second order logic	On a Second-Order Version of Russellian Theory of Definite Descriptions
semantics	Generalizing the Syntax of Terms in Mini-gringo
Sentential Calculus with Identity	Deciding Non-Fregean Identities: A Dual Tableau Approach
sequent and hypersequent calculi	GL-based calculi for PCL and its deontic cousin
Sequent calculi	On a Second-Order Version of Russellian Theory of Definite Descriptions
Similarity	On the Sensitivity of Extension Semantics to Similarity
Standpoint logics	Extending Defeasibility for Propositional Standpoint Logics
star frame	From Modal Ockham Algebras to Modal Berman Variety: Relational Semantics and Kripke-Completeness
stg2	SCC-recursiveness in infinite argumentation
Stopping criterion	A framework for computing upper bounds in passive learning settings
structured argumentation	Completing Structured Arguments in Assumption-based Argumentation
substructural logic	A Kripke Semantics for Intuitionistic Lukasiewicz Logic with Weak Excluded Middle
system W	The InfOCF Library for Reasoning With Conditional Belief Bases
system Z	The InfOCF Library for Reasoning With Conditional Belief Bases
T
Tableau	Extending Defeasibility for Propositional Standpoint Logics
Tableaux system	On Temporal References via Definite Descriptions in First-Order Monadic Logic of Order
Team Semantics	Inclusion with repetitions and Boolean constants -- implication problems revisited Strongly First Order Disjunctive Embedded Dependencies in Team Semantics
Temporal logic	A framework for computing upper bounds in passive learning settings
Temporal reference	On Temporal References via Definite Descriptions in First-Order Monadic Logic of Order
Temporal referring expressions	On Temporal References via Definite Descriptions in First-Order Monadic Logic of Order
termination	Deciding Non-Fregean Identities: A Dual Tableau Approach
theory change	Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback
tree-like	Finding short tree-like unit refutations in UTVPI Constraint Systems
U
Uniform sampling	Enhancing Query Efficiency for d-DNNF Representations Through Preprocessing
unsatisfiability analysis	Explanations of Unsatisfiability Beyond Minimal Subsets
Unsupervised Learning	Unsupervised Automata Learning via Discrete Optimization
Utility Functions	Formal Explanations of Black-Box Ranking Functions
UTVPI constraints	Finding short tree-like unit refutations in UTVPI Constraint Systems
V
verification	Generalizing the Syntax of Terms in Mini-gringo An Experiment with Anthem: Semantic Equivalence of Tiling Programs
W
weighing	Dual Scale Detachment
Well-founded Semantics	deon-B: A language for Well-Founded Deontic Planning
Z
Zero Knowledge Proof	Exposure and Hiding: Approaching the Objective Probability and Hiding the Secret in Zero-Knowledge Proof

Disclaimer | Powered by EasyChair Smart Program