A lower bound for the complexity of Craig's interpolants in sentential logic.
Daniele MundiciPublished in: Arch. Math. Log. (1983)
Keyphrases
- lower bound
- worst case
- upper bound
- objective function
- complexity analysis
- computational complexity
- branch and bound algorithm
- average case complexity
- space complexity
- logic programming
- np hard
- lower and upper bounds
- upper and lower bounds
- constant factor
- optimal solution
- branch and bound
- computational cost
- multi valued
- defeasible logic
- lower bounding