Abstract
AbstractUsing Isabelle/HOL, we verify the state-of-the-art decision procedure for multi-level syllogistic with singleton (MLSS for short), which is a quantifier-free fragment of set theory. We formalise its syntax and semantics as well as a sound and complete tableau calculus for it. We also provide an executable specification of a decision procedure that exhaustively applies the rules of the calculus and prove its termination. Furthermore, we extend the calculus with a lightweight type system that paves the way for an integration of the procedure into Isabelle/HOL.
Publisher
Springer Nature Switzerland
Reference25 articles.
1. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);B Beckert,1998
2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);B Bentzen,2021
3. Blanchette, J.C., Popescu, A., Traytel, D.: Soundness and completeness proofs by coinductive methods. J. Autom. Reason. 58(1), 149–179 (2016). https://doi.org/10.1007/s10817-016-9391-3
4. Lecture Notes in Computer Science;D Cantone,1997
5. Cantone, D., Longo, C., Asmundo, M.N.: A decision procedure for a two-sorted extension of multi-level syllogistic with the cartesian product and some map constructs. In: Faber, W., Leone, N. (eds.) Italian Conference on Computational Logic, CEUR Workshop Proceedings, vol. 598, CEUR-WS.org (2010). http://ceur-ws.org/Vol-598/paper11.pdf
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献