JELIA 2023: 18TH EUROPEAN CONFERENCE ON LOGICS IN ARTIFICIAL INTELLIGENCE

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

A
Abduction	Merge, Explain, Iterate: A Combination of MHS and MXP in an ABox Abduction Solver
Abstract Argumentation Framework	Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis
ALC_reg	Beyond ALC_reg: Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features
Alternating-time temporal logic	Robust Alternating-Time Temporal Logic
Answer Set Programming	Complexity and Scalability of Defeasible Reasoning with Typicality in Many-valued Weighted Knowledge Bases recongo: Bounded Combinatorial Reconfiguration with Answer Set Programming Computing MUS-Based Inconsistency Measures Comparing Planning Domain Models using Answer Set Programming DELPHIC: Practical DEL Planning via Possibilities Short Boolean Formulas as Explanations in Practice Reasoning in Assumption-based Argumentation using Tree-decompositions Deontic Equilibrium Logic with eXplicit Negation Hamiltonian Cycle Reconfiguration with Answer Set Programming On Heuer’s Procedure for Verifying Strong Equivalence
Answer-set Programming	Contrastive Explanations for Answer-Set Programs
Approximation Fixpoint Theory	Categorical Approximation Fixpoint Theory
Argumentation	Stable Normative Explanations: From Argumentation to Deontic Logic Weak Argumentation Semanticsand Unsafe Odd Cycles: Results and a Conjecture
ASP	Past-present Temporal Logic Programs over Finite Traces Plan Selection Framework for Policy-Aware Autonomous Agents
assumption-based argumentation	On the Expressive Power of Assumption-Based Argumentation Reasoning in Assumption-based Argumentation using Tree-decompositions
authorization and obligation policies	Plan Selection Framework for Policy-Aware Autonomous Agents
automata learning	Deterministic Weighted Automata under Partial Observability
automated legal reasoning	Combining Symbolic and Machine Learning Approaches for Automating Legal Reasoning
Automated Planning	Comparing Planning Domain Models using Answer Set Programming
Automated reasoning including satisfiability checking and its extensions	Boosting Definability Bipartition Computation using SAT Witnesses
B
Belief Revision	Belief Reconfiguration
Bipolar argumentation	A Principle-Based Analysis of Bipolar Argumentation Semantics
Boolean Circuit Classifiers	Efficient Computation of Shap Explanation Scores for Neural Network Classifiers via Knowledge Compilation
Boolean formula size	Short Boolean Formulas as Explanations in Practice
Boolean optimization	Short Boolean Formulas as Explanations in Practice
Boolean satisfiability	Computing MUS-Based Inconsistency Measures
bounded treewidth	Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets
C
c-representations	Splitting Techniques for Conditional Belief Bases in the Context of c-Representations
Category Theory	Categorical Approximation Fixpoint Theory
causal inference	Formalizing Statistical Causality via Modal Logic
Causal multiteam semantics	Strongly Complete Axiomatization for a Logic with Probabilistic Interventionist Counterfactuals
Causal reasoning	Strongly Complete Axiomatization for a Logic with Probabilistic Interventionist Counterfactuals
characterisation theorems	The Universal Tangle for Spatial Reasoning
Choice Logics	Truth and Preferences - A Game Approach for Qualitative Choice Logic
Combinatorial Reconfiguration	recongo: Bounded Combinatorial Reconfiguration with Answer Set Programming Hamiltonian Cycle Reconfiguration with Answer Set Programming
Completion	Past-present Temporal Logic Programs over Finite Traces
Complexity	Beyond ALC_reg: Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features How Easy it is to Know How: An Upper Bound for the Satisfiability Problem First Steps Towards Taming Description Logics with Strings
Composition and Unfolding	Enhancing Temporal Planning by Sequential Macro-actions
Computational complexity	Hybrid Modal Operators for Definite Descriptions Logics with Probabilistic Team Semantics and the Boolean Negation
Computing extensions	Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis
Concept Combination	Concept Combination in Weighted DL
Concrete Domain	First Steps Towards Taming Description Logics with Strings
conditional	Rational Closure Extension in SPO Representable Inductive Inference Operators
conditional belief base	Rational Closure Extension in SPO Representable Inductive Inference Operators
conditional belief bases	Splitting Techniques for Conditional Belief Bases in the Context of c-Representations
Constraint Automaton	First Steps Towards Taming Description Logics with Strings
Constraint Logic Programming	Declarative Reasoning on Explanations Using Constraint Logic Programming
constraint tableaux	Non-standard Modalities in Paraconsistent Gödel Logic
Contrastive Explanations	Declarative Reasoning on Explanations Using Constraint Logic Programming Contrastive Explanations for Answer-Set Programs
counterexample-guided abstraction refinement	Computing MUS-Based Inconsistency Measures
Counterfactual Explanations	Declarative Reasoning on Explanations Using Constraint Logic Programming
Counting operators	Hybrid Modal Operators for Definite Descriptions
D
D-FLAT	Reasoning in Assumption-based Argumentation using Tree-decompositions
Data Graphs	Data Graphs with Incomplete Information (and a Way to Complete Them)
Data Repairs	Tractable Closure-Based Possibilistic Repair for Partially Ordered DL-Lite Ontologies
decidability	Beyond ALC_reg: Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets
Decision Graphs	A New Class of Explanations for Classifiers with Non-Binary Features
Defeasible Logic	Stable Normative Explanations: From Argumentation to Deontic Logic
Defeasible Logics	Deciding Subsumption in Defeasible ELI⊥ with Typicality Models
Definability	Boosting Definability Bipartition Computation using SAT Witnesses
Definite descriptions	Hybrid Modal Operators for Definite Descriptions
Deontic Explanation	Stable Normative Explanations: From Argumentation to Deontic Logic
Deontic Logic	Stable Normative Explanations: From Argumentation to Deontic Logic
Deontic Reasoning	Deontic Equilibrium Logic with eXplicit Negation
derivation graph	Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets
Description Logic	First Steps Towards Taming Description Logics with Strings
Description logics	Beyond ALC_reg: Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features Merge, Explain, Iterate: A Combination of MHS and MXP in an ABox Abduction Solver Deciding Subsumption in Defeasible ELI⊥ with Typicality Models
Difference logic	Hybrid ASP-based Multi-objective Scheduling of Semiconductor Manufacturing Processes
do-calculus	Formalizing Statistical Causality via Modal Logic
Domain Model	Comparing Planning Domain Models using Answer Set Programming
Domain Theory	Categorical Approximation Fixpoint Theory
Dynamic Epistemic Logic	DELPHIC: Practical DEL Planning via Possibilities
dynamic programming	Reasoning in Assumption-based Argumentation using Tree-decompositions
E
Equilibrium Logic	Deontic Equilibrium Logic with eXplicit Negation
existential rules	Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets
Explainability	Short Boolean Formulas as Explanations in Practice
Explainable AI	Logic, Accountability and Design Contrastive Explanations for Answer-Set Programs A New Class of Explanations for Classifiers with Non-Binary Features Efficient Computation of Shap Explanation Scores for Neural Network Classifiers via Knowledge Compilation
Explanation Scores	Efficient Computation of Shap Explanation Scores for Neural Network Classifiers via Knowledge Compilation
Expressive power	Hybrid Modal Operators for Definite Descriptions
expressiveness	On the Expressive Power of Assumption-Based Argumentation
Expressivity of Logics	Logics with Probabilistic Team Semantics and the Boolean Negation
F
Formal Concept Analysis	Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis
G
Game Semantics	Truth and Preferences - A Game Approach for Qualitative Choice Logic
greedy bounded treewidth sets	Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets
Grounded extension	Weak Argumentation Semanticsand Unsafe Odd Cycles: Results and a Conjecture
Guards	Towards Systematic Treatment of Partial Functions in Knowledge Representation
Gödel logic	Non-standard Modalities in Paraconsistent Gödel Logic
H
Hamiltonian Cycle Reconfiguration	Hamiltonian Cycle Reconfiguration with Answer Set Programming
Hybrid Answer Set Programming	Hybrid ASP-based Multi-objective Scheduling of Semiconductor Manufacturing Processes
Hybrid operators	Hybrid Modal Operators for Definite Descriptions
I
Incomplete Data	Data Graphs with Incomplete Information (and a Way to Complete Them)
Inconsistency	Tractable Closure-Based Possibilistic Repair for Partially Ordered DL-Lite Ontologies
inconsistency measurement	Computing MUS-Based Inconsistency Measures
Independent Set Reconfiguration	recongo: Bounded Combinatorial Reconfiguration with Answer Set Programming
inductive inference operator	Rational Closure Extension in SPO Representable Inductive Inference Operators
Interactivity	Declarative Reasoning on Explanations Using Constraint Logic Programming
Interpretable AI	Short Boolean Formulas as Explanations in Practice
intervention	Formalizing Statistical Causality via Modal Logic
Interventionist counterfactuals	Strongly Complete Axiomatization for a Logic with Probabilistic Interventionist Counterfactuals
Intuitionistic Logic	Data Graphs with Incomplete Information (and a Way to Complete Them)
Iterated Belief Revision	Belief Reconfiguration
K
Knowing How	How Easy it is to Know How: An Upper Bound for the Satisfiability Problem
Knowledge Compilation	Efficient Computation of Shap Explanation Scores for Neural Network Classifiers via Knowledge Compilation
Knowledge Representation	Towards Systematic Treatment of Partial Functions in Knowledge Representation Formalizing Statistical Causality via Modal Logic
Knowledge representation reasoning and compilation	Optimal Planning with Expressive Action Languages as Constraint Optimization
Kripke model	Formalizing Statistical Causality via Modal Logic
L
Logic Methodology	Logic, Accountability and Design
Logic of Here and There	On Heuer’s Procedure for Verifying Strong Equivalence
Logic Programming	Contrastive Explanations for Answer-Set Programs
Logical Reasoning	Logic, Accountability and Design
Loop	Past-present Temporal Logic Programs over Finite Traces
M
machine learning	Combining Symbolic and Machine Learning Approaches for Automating Legal Reasoning
Macro-actions	Enhancing Temporal Planning by Sequential Macro-actions
minimal unsatisfiability	Computing MUS-Based Inconsistency Measures
Modal Description Logics	Non-Normal Modal Description Logics
Modal Languages	Data Graphs with Incomplete Information (and a Way to Complete Them)
modal logic	Base-based Model Checking for Multi-Agent Only Believing Formalizing Statistical Causality via Modal Logic Non-standard Modalities in Paraconsistent Gödel Logic
Modal logics	Hybrid Modal Operators for Definite Descriptions
Model checking	Logics with Probabilistic Team Semantics and the Boolean Negation Robust Alternating-Time Temporal Logic
mu-calculus	The Universal Tangle for Spatial Reasoning
Multi-objective optimization	Hybrid ASP-based Multi-objective Scheduling of Semiconductor Manufacturing Processes
Multi-shot ASP solving	recongo: Bounded Combinatorial Reconfiguration with Answer Set Programming
Multi-valued Logics	Complexity and Scalability of Defeasible Reasoning with Typicality in Many-valued Weighted Knowledge Bases
N
Neighbourhood Semantics	Non-Normal Modal Description Logics
Nested function terms	Towards Systematic Treatment of Partial Functions in Knowledge Representation
Nominals	Beyond ALC_reg: Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features
Non-denoting terms	Towards Systematic Treatment of Partial Functions in Knowledge Representation
Non-monotonic logics	On Heuer’s Procedure for Verifying Strong Equivalence
Non-Monotonicity	Categorical Approximation Fixpoint Theory
Non-normal Modal Logic	Non-Normal Modal Description Logics
Non-regular extensions	Beyond ALC_reg: Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features
non-standard modalities	Non-standard Modalities in Paraconsistent Gödel Logic
Nonmonotonic Reasoning	Rational Closure Extension in SPO Representable Inductive Inference Operators Deciding Subsumption in Defeasible ELI⊥ with Typicality Models Deontic Equilibrium Logic with eXplicit Negation
O
Only believing and knowing	Base-based Model Checking for Multi-Agent Only Believing
Ontologies	Merge, Explain, Iterate: A Combination of MHS and MXP in an ABox Abduction Solver Tractable Closure-Based Possibilistic Repair for Partially Ordered DL-Lite Ontologies
Overfitting error	Short Boolean Formulas as Explanations in Practice
P
Partial functions	Towards Systematic Treatment of Partial Functions in Knowledge Representation
Partial Observability	Succinct Planning with Partial Observability by SAT
Partial Orders	Tractable Closure-Based Possibilistic Repair for Partially Ordered DL-Lite Ontologies
planning	Plan Selection Framework for Policy-Aware Autonomous Agents Succinct Planning with Partial Observability by SAT
Planning and diagnosis based on logic	Optimal Planning with Expressive Action Languages as Constraint Optimization
Possibilities	DELPHIC: Practical DEL Planning via Possibilities
Preferences	Truth and Preferences - A Game Approach for Qualitative Choice Logic
Prime Implicants/Implicates	A New Class of Explanations for Classifiers with Non-Binary Features
Principle-based approach	A Principle-Based Analysis of Bipolar Argumentation Semantics
Probabilistic logics	Strongly Complete Axiomatization for a Logic with Probabilistic Interventionist Counterfactuals
Probabilistic Team Semantics	Logics with Probabilistic Team Semantics and the Boolean Negation
proof-theory	Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets
Propositional Dynamic Logic	Beyond ALC_reg: Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features
Propositional logic	Boosting Definability Bipartition Computation using SAT Witnesses
Prototype Theory	Concept Combination in Weighted DL
Q
query entailment	Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets
R
ranking functions	Splitting Techniques for Conditional Belief Bases in the Context of c-Representations
rational closure	Rational Closure Extension in SPO Representable Inductive Inference Operators
rational closure extension	Rational Closure Extension in SPO Representable Inductive Inference Operators
rational monotony	Rational Closure Extension in SPO Representable Inductive Inference Operators
Reasoning about actions	Optimal Planning with Expressive Action Languages as Constraint Optimization
Reasoning about knowledge and beliefs	Base-based Model Checking for Multi-Agent Only Believing
Reliability	Belief Reconfiguration
Robustness	Robust Alternating-Time Temporal Logic
S
SAT	Succinct Planning with Partial Observability by SAT
Satisfiability	Robust Alternating-Time Temporal Logic How Easy it is to Know How: An Upper Bound for the Satisfiability Problem
Satisfiability and Validity	Logics with Probabilistic Team Semantics and the Boolean Negation
Self-defeating arguments	Weak Argumentation Semanticsand Unsafe Odd Cycles: Results and a Conjecture
Semiconductor manufacturing scheduling	Hybrid ASP-based Multi-objective Scheduling of Semiconductor Manufacturing Processes
Shap	Efficient Computation of Shap Explanation Scores for Neural Network Classifiers via Knowledge Compilation
signatures	On the Expressive Power of Assumption-Based Argumentation
spatial logics	The Universal Tangle for Spatial Reasoning
specification synthesis	Deterministic Weighted Automata under Partial Observability
splitting techniques	Splitting Techniques for Conditional Belief Bases in the Context of c-Representations
String Theory	First Steps Towards Taming Description Logics with Strings
Strong Equivalence	On Heuer’s Procedure for Verifying Strong Equivalence
Strongly complete axiom systems	Strongly Complete Axiomatization for a Logic with Probabilistic Interventionist Counterfactuals
structured argumentation	On the Expressive Power of Assumption-Based Argumentation
Subsumption	Deciding Subsumption in Defeasible ELI⊥ with Typicality Models
Support	A Principle-Based Analysis of Bipolar Argumentation Semantics
symbolic AI	Combining Symbolic and Machine Learning Approaches for Automating Legal Reasoning
system P	Rational Closure Extension in SPO Representable Inductive Inference Operators
system Z	Rational Closure Extension in SPO Representable Inductive Inference Operators
T
Tableaux Calculi	Non-Normal Modal Description Logics
tangle logic	The Universal Tangle for Spatial Reasoning
Temporal logic	Past-present Temporal Logic Programs over Finite Traces
Temporal Planning	Enhancing Temporal Planning by Sequential Macro-actions
TGDs	Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets
topological modal logic	The Universal Tangle for Spatial Reasoning
tree-decompositions	Reasoning in Assumption-based Argumentation using Tree-decompositions
Trustworthy AI	Logic, Accountability and Design
Typicality Logics	Complexity and Scalability of Defeasible Reasoning with Typicality in Many-valued Weighted Knowledge Bases
U
uncertain reasoning	Splitting Techniques for Conditional Belief Bases in the Context of c-Representations
Undecidability	Beyond ALC_reg: Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features
V
Visibly Pushdown Languages	Beyond ALC_reg: Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features
W
Weak admissibility	Weak Argumentation Semanticsand Unsafe Odd Cycles: Results and a Conjecture
weighted automata	Deterministic Weighted Automata under Partial Observability
Weighted Description Logic	Concept Combination in Weighted DL

Disclaimer | Powered by EasyChair Smart Program