Omitting types for algebraizable extensions of first order logic.
Tarek Sayed AhmedPublished in: J. Appl. Non Class. Logics (2005)
Keyphrases
- first order logic
- expressive power
- propositional logic
- inference rules
- theorem proving
- markov networks
- probabilistic graphical models
- representation language
- probabilistic reasoning
- knowledge representation
- inductive logic programming
- theorem prover
- relational algebra
- transitive closure
- horn clauses
- predicate calculus
- logical rules
- graphical models
- constraint databases
- markov logic
- quantifier free
- query language
- proof procedure