We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Influenced by the success of the MIZAR system many declarative proof languages have been developed in the theorem prover community, as declarative proofs are more readable, easier...
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...