Hardness of preorder checking for basic formalisms.
Laura BozzelliAxel LegaySophie PinchinatPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- phase transition
- knowledge representation
- computational properties
- nonmonotonic reasoning
- information theoretic
- knowledge representation formalisms
- reasoning tasks
- learning theory
- worst case
- np hard
- computational complexity
- neural network
- np complete
- databases
- search space
- data structure
- action theories
- probabilistic knowledge