A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property.
H. J. Sander BrugginkPublished in: RTA (2006)
Keyphrases
- higher order
- higher order logic
- presburger arithmetic
- high order
- data structure
- special case
- complete axiomatization
- pairwise
- markov random field
- conditional random fields
- theorem prover
- natural images
- artificial intelligence
- rewrite rules
- desirable properties
- conjunctive queries
- multiscale
- theorem proving
- low order
- linear logic
- rewriting rules
- programming language
- rewriting systems
- integer points
- neural network
- monadic datalog