Article

Constructive formalization of hybrid logic with eventualities

Authors:

Christian Doczkal,

Gert SmolkaAuthors Info & Claims

CPP'11: Proceedings of the First international conference on Certified Programs and Proofs

Pages 5 - 20

https://doi.org/10.1007/978-3-642-25379-9_3

Published: 07 December 2011 Publication History

Abstract

This paper reports on the formalization of classical hybrid logic with eventualities in the constructive type theory of the proof assistant Coq. We represent formulas and models and define satisfiability, validity, and equivalence of formulas. The representation yields the classical equivalences and does not require axioms. Our main results are an algorithmic proof of a small model theorem and the computational decidability of satisfiability, validity, and equivalence of formulas. We present our work in three steps: propositional logic, modal logic, and finally hybrid logic.

References

[1]

Areces, C., ten Cate, B.: Hybrid logics. In: Blackburn, P., et al. (eds.) {2}, pp. 821-868.

[2]

Blackburn, P., van Benthem, J., Wolter, F. (eds.): Handbook of Modal Logic, Studies in Logic and Practical Reasoning, vol. 3. Elsevier (2007).

Digital Library

[3]

Caldwell, J.L.: Classical Propositional Decidability Via Nuprl Proof Extraction. In: Grundy, J., Newey, M. (eds.) TPHOLs 1998. LNCS, vol. 1479, pp. 105-122. Springer, Heidelberg (1998).

Digital Library

[4]

Emerson, E.A., Clarke, E.M.: Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comput. Programming 2(3), 241-266 (1982).

[5]

Emerson, E.A., Halpern, J.Y.: Decision procedures and expressiveness in the temporal logic of branching time. J. Comput. System Sci. 30(1), 1-24 (1985).

Digital Library

[6]

Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. System Sci., 194-211 (1979).

[7]

Garillot, F., Gonthier, G., Mahboubi, A., Rideau, L.: Packaging Mathematical Structures. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 327-342. Springer, Heidelberg (2009).

Digital Library

[8]

Gonthier, G., Mahboubi, A., Rideau, L., Tassi, E., Théry, L.: A Modular Formalisation of Finite Group Theory. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 86-101. Springer, Heidelberg (2007).

Digital Library

[9]

Gonthier, G., Mahboubi, A., Tassi, E.: A Small Scale Reflection Extension for the Coq system. Research Report RR-6455, INRIA (2008), http://hal.inria.fr/inria-00258384/en/

[10]

Ilik, D., Lee, G., Herbelin, H.: Kripke models for classical logic. Ann. Pure Appl. Logic 161(11), 1367-1378 (2010).

[11]

Kaminski, M., Schneider, T., Smolka, G.: Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics. In: Brünnler, K., Metcalfe, G. (eds.) TABLEAUX 2011. LNCS (LNAI), vol. 6793, pp. 196-210. Springer, Heidelberg (2011).

Digital Library

[12]

Kaminski, M., Smolka, G.: Terminating Tableaux for Hybrid Logic with Eventualities. In: Giesl, J., Hähnle, R. (eds.) IJCAR 2010. LNCS, vol. 6173, pp. 240-254. Springer, Heidelberg (2010).

Digital Library

[13]

Norrish, M.: Mechanised Computability Theory. In: van Eekelen, M., Geuvers, H., Schmaltz, J., Wiedijk, F. (eds.) ITP 2011. LNCS, vol. 6898, pp. 297-311. Springer, Heidelberg (2011).

Digital Library

[14]

Pratt, V.R.:Models of program logics. In: Proc. 20th Annual Symp. on Foundations of Computer Science (FOCS 1979), pp. 115-122. IEEE Computer Society Press (1979).

Digital Library

[15]

The Coq Development Team: The Coq Proof Assistant Reference Manual - Version 8.3. INRIA, France (2011), http://coq.inria.fr

[16]

Théry, L.: A machine-checked implementation of Buchberger's algorithm. J. Autom. Reasoning 26(2), 107-137 (2001).

Digital Library

[17]

Zammit, V.: A Mechanization of Computability Theory in HOL. In: von Wright, J., Harrison, J., Grundy, J. (eds.) TPHOLs 1996. LNCS, vol. 1125, pp. 431-446. Springer, Heidelberg (1996).

Digital Library

Cited By

From ABlackburn PVilladsen J(2020)Formalizing a Seligman-Style Tableau System for Hybrid LogicAutomated Reasoning10.1007/978-3-030-51074-9_27(474-481)Online publication date: 1-Jul-2020
https://dl.acm.org/doi/10.1007/978-3-030-51074-9_27
Doczkal CSmolka G(2012)Constructive completeness for modal logic with transitive closureProceedings of the Second international conference on Certified Programs and Proofs10.1007/978-3-642-35308-6_18(224-239)Online publication date: 13-Dec-2012
https://dl.acm.org/doi/10.1007/978-3-642-35308-6_18

Constructive formalization of hybrid logic with eventualities

Recommendations

Constructive completeness for modal logic with transitive closure
CPP'12: Proceedings of the Second international conference on Certified Programs and Proofs

Classical modal logic with transitive closure appears as a subsystem of logics used for program verification. The logic can be axiomatized with a Hilbert system. In this paper we develop a constructive completeness proof for the axiomatization using Coq ...
Completeness and decidability of converse PDL in the constructive type theory of Coq
CPP 2018: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs

The completeness proofs for Propositional Dynamic Logic (PDL) in the literature are non-constructive and usually presented in an informal manner. We obtain a formal and constructive completeness proof for Converse PDL by recasting a completeness proof ...
Completeness and Decidability Results for CTL in Constructive Type Theory

We prove completeness and decidability results for the temporal logic CTL in Coq/Ssreflect. Our main result is a constructive proof that for every formula one can obtain either a finite model satisfying the formula or a proof in a Hilbert system ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

CPP'11: Proceedings of the First international conference on Certified Programs and Proofs

December 2011

400 pages

ISBN:9783642253782

Editors:
Jean-Pierre Jouannaud
Tsinghua University, Beijing, China
,
Zhong Shao
Department of Computer Science, Yale University, 51 Prospect Street, New Haven, CT, China

Sponsors

Tsinghua University: TsingHua University Philips Research
Academia Sinica: Academia Sinica
Advances in image and video technology: Advances in image and video technology
National Science Council: National Science Council (Taiwan)

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 07 December 2011

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

From ABlackburn PVilladsen J(2020)Formalizing a Seligman-Style Tableau System for Hybrid LogicAutomated Reasoning10.1007/978-3-030-51074-9_27(474-481)Online publication date: 1-Jul-2020
https://dl.acm.org/doi/10.1007/978-3-030-51074-9_27
Doczkal CSmolka G(2012)Constructive completeness for modal logic with transitive closureProceedings of the Second international conference on Certified Programs and Proofs10.1007/978-3-642-35308-6_18(224-239)Online publication date: 13-Dec-2012
https://dl.acm.org/doi/10.1007/978-3-642-35308-6_18

View Options

View options

Media

Figures

Other

Tables

View Table of Contents