Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
1802.08201
Cited By
v1
v2 (latest)
A Polynomial Time Subsumption Algorithm for Nominal Safe
E
L
O
⊥
\mathcal{ELO}_\bot
E
L
O
⊥
under Rational Closure
22 February 2018
Giovanni Casini
U. Straccia
T. Meyer
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"A Polynomial Time Subsumption Algorithm for Nominal Safe $\mathcal{ELO}_\bot$ under Rational Closure"
16 / 16 papers shown
A preferential interpretation of MultiLayer Perceptrons in a conditional logic with typicality
International Journal of Approximate Reasoning (IJAR), 2023
Mario Alviano
Francesco Bartoli
Marco Botta
Roberto Esposito
Laura Giordano
Daniele Theseider Dupré
378
12
0
29 Apr 2023
From Weighted Conditionals of Multilayer Perceptrons to Gradual Argumentation and Back
Laura Giordano
AI4CE
279
2
0
07 Oct 2021
Weighted Conditional EL{^}bot Knowledge Bases with Integer Weights: an ASP Approach
Laura Giordano
Daniele Theseider Dupré
182
7
0
17 Sep 2021
Reasoning on
DL-Lite
R
\textit{DL-Lite}_{\cal R}
DL-Lite
R
with Defeasibility in ASP
Theory and Practice of Logic Programming (TPLP), 2021
Loris Bozzato
Thomas Eiter
Luciano Serafini
LRM
201
2
0
28 Jun 2021
A Rational Entailment for Expressive Description Logics via Description Logic Programs
Giovanni Casini
U. Straccia
151
2
0
28 Jun 2021
On the KLM properties of a fuzzy DL with Typicality
European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU), 2021
Laura Giordano
358
21
0
01 Jun 2021
A conditional, a fuzzy and a probabilistic interpretation of self-organising maps
Journal of Logic and Computation (J. Log. Comput.), 2021
Laura Giordano
Valentina Gliozzi
Daniele Theseider Dupré
AI4CE
341
24
0
11 Mar 2021
Weighted defeasible knowledge bases and a multipreference semantics for a deep neural network model
European Conference on Logics in Artificial Intelligence (JELIA), 2020
Laura Giordano
Daniele Theseider Dupré
288
38
0
24 Dec 2020
Defeasible reasoning in Description Logics: an overview on DL^N
Applications and Practices in Ontology Design, Extraction, and Reasoning (PODER), 2020
P. Bonatti
I. Petrova
L. Sauro
109
3
0
10 Sep 2020
A framework for a modular multi-concept lexicographic closure semantics
Italian Conference on Computational Logic (CILC), 2020
Laura Giordano
Daniele Theseider Dupré
KELM
297
8
0
02 Sep 2020
Defeasible RDFS via Rational Closure
Information Sciences (Inf. Sci.), 2020
Giovanni Casini
U. Straccia
AI4CE
146
5
0
15 Jul 2020
An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
Laura Giordano
Daniele Theseider Dupré
167
39
0
08 Jun 2020
Reasoning about Typicality and Probabilities in Preferential Description Logics
Applications and Practices in Ontology Design, Extraction, and Reasoning (PODER), 2020
Laura Giordano
Valentina Gliozzi
Antonio Lieto
Nicola Olivetto
G. Pozzato
180
8
0
20 Apr 2020
Theoretical Foundations of Defeasible Description Logics
K. Britz
Giovanni Casini
T. Meyer
Kodylan Moodley
U. Sattler
I. Varzinczak
AI4CE
146
5
0
16 Apr 2019
On Rational Entailment for Propositional Typicality Logic
Artificial Intelligence (AI), 2018
Richard Booth
Giovanni Casini
T. Meyer
I. Varzinczak
132
29
0
28 Sep 2018
Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure
Laura Giordano
Valentina Gliozzi
LRM
139
10
0
08 Jul 2018
1
Page 1 of 1
