Abstract. The two puzzles are the Lottery Paradox and the Amalgamation Paradox, which both point out difficulties for aggregating uncertain information. A generalization of the lot...
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...
There is a growing interest in the integration of mechanized reasoning systems such as automated theorem provers, computer algebra systems, and model checkers. State-of-the-art re...
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
Abstract. The LogAnswer system is an application of automated reasoning to the field of open domain question-answering, the retrieval of answers to natural language questions regar...