The Complexity of Satisfiability for Sub-Boolean Fragments of ALC.

Arne Meier Thomas Schneider

Published in: Description Logics (2010)

Keyphrases

computational complexity
description logics
propositional logic
decision problems
boolean formula
data sets
real valued
machine learning
upper bound
np complete
artificial intelligence
natural language
satisfiability problem
space complexity
conjunctive normal form
description logic alc