Unsatisfiable Formulae of Gödel Logic with Truth Constants and \varDelta Are Recursively Enumerable.
Dusan GullerPublished in: IJCCI (Selected Papers) (2014)
Keyphrases
- valued logic
- classical logic
- truth values
- propositional logic
- multi valued
- fuzzy logic
- first order logic
- logic programs
- logic programming
- modal logic
- real valued functions
- recursively enumerable
- recursive functions
- phase transition
- inductive inference
- sat solvers
- neural network
- small number
- active learning
- training set
- knowledge base