The Computational Complexity of Propositional Cirquent Calculus.
Matthew S. BauerPublished in: Log. Methods Comput. Sci. (2015)
Keyphrases
- computational complexity
- proof procedure
- propositional logic
- first order logic
- computational cost
- high computational complexity
- memory requirements
- np complete
- np hard
- computationally efficient
- low complexity
- special case
- theorem proving
- belief revision
- statistical relational learning
- multi valued
- default logic
- decision problems
- computational efficiency
- motion estimation
- bayesian networks
- expressive power
- prime implicates
- strips planning
- linear computational complexity