On Generalizing Decidable Standard Prefix Classes of First-Order Logic.
Marco VoigtPublished in: CoRR (2017)
Keyphrases
- first order logic
- expressive power
- theorem proving
- propositional logic
- transitive closure
- theorem prover
- knowledge representation
- inference rules
- representation language
- inductive logic programming
- probabilistic graphical models
- probabilistic reasoning
- relational algebra
- markov logic networks
- horn clauses
- constraint databases
- function symbols
- quantifier free
- markov networks
- quantifier elimination
- expert systems
- data exchange
- probabilistic model
- logical formulas
- logical rules
- special case