Finding good proofs for description logic entailments using recursive quality measures
From MaRDI portal
Recommendations
Cites work
- An introduction to description logic
- Directed hypergraphs and applications
- Finding good proofs for description logic entailments using recursive quality measures
- scientific article; zbMATH DE number 4164180 (Why is no real title available?)
- Mechanizing Mathematical Reasoning
- Reconstructing proofs at the assertion level
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
Cited in
(8)- Finding good proofs for description logic entailments using recursive quality measures
- Theorem proving as constraint solving with coherent logic
- Evonne: interactive proof visualization for description logics (system description)
- Efficiently explaining CSPs with unsatisfiable subset optimization
- The concrete \textsc{Evonne}: visualization meets concrete domain reasoning
- Small term reachability and related problems for terminating term rewriting systems
- On the complexity of the small term reachability problem for terminating term rewriting systems
- Explaining reasoning results for description logic ontologies (invited paper)
This page was built for publication: Finding good proofs for description logic entailments using recursive quality measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055864)