Complexity and scalability of defeasible reasoning in many-valued weighted knowledge bases with typicality
From MaRDI portal
Cites work
- \({\mathcal{ALC}}+T\): a preferential extension of description logics
- A description logic of typicality for conceptual combination
- A non-monotonic description logic for reasoning about typicality
- A preferential interpretation of multilayer perceptrons in a conditional logic with typicality
- A treatise on many-valued logics
- Adding threshold concepts to the description logic \(\mathcal{EL}\)
- An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
- An ASP Approach for Reasoning on Neural Networks under a Finitely Many-Valued Semantics for Weighted Conditional Knowledge Bases
- Another perspective on default reasoning
- ASP-Core-2 input language format
- Bounded Query Classes
- Combining answer set programming with description logics for the semantic web
- Compiling finite linear CSP into SAT
- Complexity and scalability of defeasible reasoning with typicality in many-valued weighted knowledge bases
- Conditionals in nonmonotonic reasoning and belief revision. Considering conditionals as agents
- Defeasible inclusions in low-complexity DLs
- Defeasible inheritance-based description logics
- Description logic programs under probabilistic uncertainty and fuzzy vagueness
- Description logics of minimal knowledge and negation as failure
- Enhancing context knowledge repositories with justifiable exceptions
- Fuzzy description logics and \(t\)-norm based fuzzy logics
- scientific article; zbMATH DE number 4174344 (Why is no real title available?)
- scientific article; zbMATH DE number 1392848 (Why is no real title available?)
- Joining Gödel and Zadeh fuzzy logics in fuzzy description logics
- Multi-shot ASP solving with clingo
- Nonmonotonic reasoning, preferential models and cumulative logics
- On the (un)decidability of fuzzy description logics under Łukasiewicz t-norm
- On the KLM properties of a fuzzy DL with typicality
- On truth-table reducibility to SAT
- Ordered models for concept representation
- Preferential Description Logics
- Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
- Rational Closure for Defeasible Description Logics
- Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure
- Reasoning on multirelational contextual hierarchies via answer set programming with algebraic measures
- Reasoning with the finitely many-valued Łukasiewicz fuzzy description logic \(\mathcal {SROIQ}\)
- Reasoning within fuzzy OWL 2 EL revisited
- Reconciling description logics and rules
- Reconciling OWL and non-monotonic rules for the semantic web
- Reluplex: an efficient SMT solver for verifying deep neural networks
- Semantic characterization of rational closure: from propositional logic to description logics
- System JLZ -- rational default reasoning by minimal ranking constructions.
- Taking defeasible entailment beyond rational closure
- The complexity of circumscription in DLs
- The Description Logic Handbook
- Towards rational closure for fuzzy logic: the case of propositional Gödel logic
- Value-based Argumentation Frameworks as Neural-symbolic Learning Systems
- Weighted conditional \(\mathscr{EL}^\bot\) knowledge bases with integer weights: an ASP approach
- Weighted defeasible knowledge bases and a multipreference semantics for a deep neural network model
- Well-founded semantics for description logic programs in the semantic web
- What does a conditional knowledge base entail?
This page was built for publication: Complexity and scalability of defeasible reasoning in many-valued weighted knowledge bases with typicality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7004086)
