Omitting types theorem in hybrid dynamic first-order logic with rigid symbols.
Daniel GainaGuillermo BadiaTomasz KowalskiPublished in: Ann. Pure Appl. Log. (2023)
Keyphrases
- first order logic
- expressive power
- propositional logic
- theorem proving
- theorem prover
- inference rules
- probabilistic graphical models
- markov networks
- knowledge representation
- inductive logic programming
- representation language
- probabilistic reasoning
- transitive closure
- predicate calculus
- valued logic
- logical rules
- proof procedure
- timed automata
- quantifier elimination
- constraint databases
- relational algebra
- markov logic networks
- horn clauses
- conjunctive queries
- computational complexity
- database