Approximate formulae for a logic that capture classes of computational complexity.
Argimiro ArratiaCarlos E. OrtizPublished in: Log. J. IGPL (2009)
Keyphrases
- computational complexity
- logic programming
- np complete
- multi valued
- special case
- computational cost
- classical logic
- finite model theory
- bayesian networks
- predicate logic
- modal logic
- low complexity
- class hierarchy
- epistemic logic
- high computational complexity
- exact solution
- storage requirements
- real time
- decision problems
- computationally efficient
- databases
- data sets