The expected complexity of analytic tableaux analyses in propositional calculus.
Jacob Manuel PlotkinJohn W. RosenthalPublished in: Notre Dame J. Formal Log. (1982)
Keyphrases
- propositional calculus
- computational complexity
- comparative analysis
- worst case
- hidden markov models
- space complexity
- computational cost
- decision trees
- artificial intelligence
- search algorithm
- expert systems
- real time
- information systems
- np complete
- databases
- complexity analysis
- high computational complexity
- decision procedures
- data sets