Implementing an Efficient SAT Solver for a Probabilistic Description Logic.
Pavel KlinovBijan ParsiaPublished in: IWIL@LPAR (2010)
Keyphrases
- description logics
- sat solvers
- computational properties
- knowledge base
- sat instances
- reasoning tasks
- knowledge representation
- orders of magnitude
- snomed ct
- search strategies
- semantic web
- reasoning problems
- search space
- constraint satisfaction
- sat problem
- ontology languages
- bayesian networks
- probabilistic model
- owl ontologies
- dl lite
- optimal solution
- description logic programs
- computational problems
- expert systems
- lower bound