Unsatisfiable Formulae of Gödel Logic with Truth Constants and , \prec , \Delta Are Recursively Enumerable.
Dusan GullerPublished in: ICSI (3) (2015)
Keyphrases
- valued logic
- classical logic
- truth values
- propositional logic
- fuzzy logic
- multi valued
- first order logic
- recursive functions
- recursively enumerable
- logic programming
- modal logic
- inductive inference
- logic programs
- phase transition
- real valued functions
- sat solvers
- data sets
- machine learning
- neural network
- domain knowledge
- lower bound
- e learning