Optimising propositional modal satisfiability for description logic subsumption

DOI10.1007/BFB0055916MaRDI QIDQ4217959zbMATH OpenFDO

Authors Ian Horrocks, Peter F. Patel-Schneider

Publication date 11 November 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0055916

zbMATH Keywords

knowledge representation systems

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Optimizing description logic subsumption
• Evaluating optimized decision procedures for propositional modal K(m) satisfiability
• Evaluating optimised decision procedures for propositional modal \({\mathbf K}_{({\mathbf m})}\) satisfiability
• Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ $\mathcal{ALC}$
• Practical reasoning for very expressive description logics

Cited in

(6)

• scientific article; zbMATH DE number 1612554 (Why is no real title available?)
• Evaluating optimised decision procedures for propositional modal \({\mathbf K}_{({\mathbf m})}\) satisfiability
• scientific article; zbMATH DE number 5770428 (Why is no real title available?)
• Optimizing description logic subsumption
• HTab: a terminating tableaux system for hybrid logic
• The Tableau Workbench

This page was built for publication: Optimising propositional modal satisfiability for description logic subsumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4217959)