Sciweavers

Share
AISC
1998
Springer

Optimising Propositional Modal Satisfiability for Description Logic Subsumption

8 years 7 months ago
Optimising Propositional Modal Satisfiability for Description Logic Subsumption
Effective optimisation techniques can make a dramatic difference in the performance of knowledge representation systems based on expressive description logics. Because of the correspondence between description logics and propositional modal logic many of these techniques carry over into propositional modal logic satisfiability checking. Currently-implemented representation systems that employ these techniques, such as FaCT and DLP, make effective satisfiable checkers for various propositional modal logics.
Ian Horrocks, Peter F. Patel-Schneider
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where AISC
Authors Ian Horrocks, Peter F. Patel-Schneider
Comments (0)
books