Pages that link to "Item:Q2946628"
From MaRDI portal
The following pages link to Well-founded semantics for description logic programs in the semantic web (Q2946628):
Displaying 14 items.
- Data repair of inconsistent nonmonotonic description logic programs (Q322065) (← links)
- From description-logic programs to multi-context systems (Q516031) (← links)
- Local closed world reasoning with description logics under the well-founded semantics (Q646502) (← links)
- The loop formula based semantics of description logic programs (Q764312) (← links)
- Open answer set programming for the semantic web (Q881833) (← links)
- Exploiting conjunctive queries in description logic programs (Q1028641) (← links)
- A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure (Q2224833) (← links)
- On the Turing completeness of the semantic web (Q2345982) (← links)
- Combining answer set programming with description logics for the semantic web (Q2389666) (← links)
- Flexible Approximators for Approximating Fixpoint Theory (Q2814522) (← links)
- Answer Set Programming: A Primer (Q3638997) (← links)
- Reasoning about Exceptions in Ontologies: from the Lexicographic Closure to the Skeptical Closure (Q4988945) (← links)
- An ASP approach for reasoning in a concept-aware multipreferential lightweight DL (Q5140012) (← links)
- Defeasible RDFS via rational closure (Q6490339) (← links)
