Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language.
Thomas PowellPublished in: CoRR (2023)
Keyphrases
- first order logic
- theorem proving
- theorem prover
- representation language
- predicate calculus
- dynamic logic
- expressive power
- highly expressive
- quantifier free
- inference rules
- classical first order logic
- propositional logic
- high level
- inductive logic programming
- knowledge representation
- markov networks
- function symbols
- probabilistic reasoning
- relational structures
- transitive closure
- closure operator
- term rewriting
- programming language
- probabilistic graphical models
- relational algebra
- natural language
- proof procedure
- quantifier elimination
- relational calculus
- monadic second order logic
- constraint databases
- markov logic
- logic programs