Pages that link to "Item:Q2224833"
From MaRDI portal
The following pages link to A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure (Q2224833):
Displaying 13 items.
- Satisfiability and reasoning mechanism of terminological cycles in description logic \(v\mathcal L\) (Q948503) (← links)
- Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics (Q1726275) (← links)
- Weighted defeasible knowledge bases and a multipreference semantics for a deep neural network model (Q2055796) (← links)
- Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\) (Q2082509) (← links)
- On the KLM properties of a fuzzy DL with typicality (Q2146055) (← links)
- On rational entailment for propositional typicality logic (Q2289021) (← links)
- Rational closure for all description logics (Q2321316) (← links)
- Reasoning with nominal schemas through absorption (Q2352498) (← links)
- An ASP approach for reasoning in a concept-aware multipreferential lightweight DL (Q5140012) (← links)
- Reasoning on with Defeasibility in ASP (Q6063881) (← links)
- Defeasible RDFS via rational closure (Q6490339) (← links)
- A preferential interpretation of multilayer perceptrons in a conditional logic with typicality (Q6570288) (← links)
- Weighted conditional \(\mathscr{EL}^\bot\) knowledge bases with integer weights: an ASP approach (Q6647308) (← links)
