First-Order Logic with Counting: At Least, Weak Hanf Normal Forms Always Exist and Can Be Computed!
Dietrich KuskeNicole SchweikardtPublished in: CoRR (2017)
Keyphrases
- first order logic
- normal form
- function symbols
- relational algebra
- expressive power
- propositional logic
- database design
- probabilistic reasoning
- inference rules
- theorem proving
- functional dependencies
- theorem prover
- incomplete information
- relational databases
- inductive logic programming
- knowledge representation
- database theory
- representation language
- horn clauses
- transitive closure
- relational calculus
- markov logic networks
- relational model
- markov logic
- database systems