A completeness-proof method for extensions of the implicational fragment of the propositional calculus.
Diderik BatensPublished in: Notre Dame J. Formal Log. (1980)
Keyphrases
- dynamic programming
- experimental evaluation
- high precision
- prior knowledge
- objective function
- computational complexity
- computational cost
- high accuracy
- mutual information
- fully automatic
- optimization algorithm
- propositional calculus
- data sets
- optimization method
- synthetic data
- detection method
- clustering method
- support vector machine svm
- theoretical analysis
- computationally efficient
- pairwise
- preprocessing