Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ALC.
Roberto SebastianiMichele VescoviPublished in: SAT (2006)
Keyphrases
- description logic alc
- description logics
- case study
- sat encodings
- modal logic
- knowledge base
- satisfiability problem
- knowledge representation
- sat solvers
- reasoning tasks
- reasoning problems
- dl lite
- computing least common subsumers
- exptime complete
- computational properties
- sat problem
- terminological reasoning
- semantic web
- model theoretic
- propositional satisfiability
- concept descriptions
- ontology languages
- number restrictions
- search algorithm
- max sat
- phase transition
- boolean formula
- constraint satisfaction problems
- np complete
- fuzzy description logics
- knowledge representation languages
- inverse roles
- machine learning