An asymptotically tight bound on countermodels for Lukasiewicz logic.
Stefano AguzzoliPublished in: Int. J. Approx. Reason. (2006)
Keyphrases
- worst case
- modal logic
- lower bound
- upper bound
- truth values
- error bounds
- sample size
- classical logic
- generalization error bounds
- temporal logic
- computational complexity
- multi valued
- real time
- predicate logic
- computational properties
- asymptotically optimal
- logic programming
- automated reasoning
- inference rules
- vc dimension
- situation calculus
- logical framework
- data mining
- defeasible logic
- information systems
- neural network
- model selection