Download PDFOpen PDF in browserImplementing Polymorphism in Zenon6 pages•Published: September 27, 2016AbstractExtending first-order logic with ML-style polymorphism allows to definegeneric axioms dealing with several sorts. Until recently, most automated theorem provers relied on preprocess encodings into mono/many-sorted logic to reason within such theories. In this paper, we discuss the implementation of polymorphism into the first-order tableau-based automated theorem prover Zenon. This implementation leads to slightly modify some basic parts of the code, from the representation of expressions to the proof-search algorithm. Keyphrases: automated theorem proving, first order logic, ml polymorphism, tableau method In: Boris Konev, Stephan Schulz and Laurent Simon (editors). IWIL-2015. 11th International Workshop on the Implementation of Logics, vol 40, pages 15-20.
|