Logics of time and computation
Logics of time and computation
Introduction to Mathematical Logic and Type Theory: To Truth through Proof
Introduction to Mathematical Logic and Type Theory: To Truth through Proof
Tableaux for Quantified Hybrid Logic
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Natural Deduction for First-Order Hybrid Logic
Journal of Logic, Language and Information
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
THF0 --- The Core of the TPTP Language for Higher-Order Logic
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Terminating Tableau Systems for Hybrid Logic with Difference and Converse
Journal of Logic, Language and Information
Progress in the Development of Automated Theorem Proving for Higher-Order Logic
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
The TPTP Problem Library and Associated Infrastructure
Journal of Automated Reasoning
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
A modal deconstruction of access control logics
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Analytic tableaux for higher-order logic with choice
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Verifying the modal logic cube is an easy task: for higher-order automated reasoners
Verification, induction termination analysis
Verifying the modal logic cube is an easy task: for higher-order automated reasoners
Verification, induction termination analysis
Combining and automating classical and non-classical logics in classical higher-order logics
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be elegantly embedded in simple type theory. Furthermore, simple type theory is sufficiently expressive to model combinations of embedded logics and it has a well understood semantics. Off-the-shelf reasoning systems for simple type theory exist that can be uniformly employed for reasoning within and about combinations of logics. Combinations of modal logics and other logics are particularly relevant for multi-agent systems.