Pages that link to "Item:Q2224833"

The following pages link to A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure (Q2224833):

Displaying 9 items.

• 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)
• 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)