Combining and automating classical and non-classical logics in classical higher-order logics

Authors:
Christoph Benzmüller
Affiliations:
Articulate Software, Angwin, USA
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2011

Citing 21
Cited 1

Logics of time and computation

Logics of time and computation
Theorem Proving via General Matings

Journal of the ACM (JACM)
Introduction to Mathematical Logic and Type Theory: To Truth through Proof

Introduction to Mathematical Logic and Type Theory: To Truth through Proof
Extensional Higher-Order Paramodulation and RUE-Resolution

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Tableaux for Quantified Hybrid Logic

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
System Description: LEO - A Higher-Order Theorem Prover

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Natural Deduction for First-Order Hybrid Logic

Journal of Logic, Language and Information
Multimodal logic programming

Theoretical Computer Science
Handbook of Modal Logic, Volume 3 (Studies in Logic and Practical Reasoning)

Handbook of Modal Logic, Volume 3 (Studies in Logic and Practical Reasoning)
E - a brainiac theorem prover

AI Communications - CASC
LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)

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
Automated Reasoning in Higher-order Logic: Set Comprehension and Extensionality in Church's Type Theory

Automated Reasoning in Higher-order Logic: Set Comprehension and Extensionality in Church's Type Theory
Terminating Tableau Systems for Hybrid Logic with Difference and Converse

Journal of Logic, Language and Information
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
Combining logics in simple type theory

CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
The TPTP world - infrastructure for automated reasoning

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Verifying the modal logic cube is an easy task: for higher-order automated reasoners

Verification, induction termination analysis
Analytic tableaux for higher-order logic with choice

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
TPTP, TSTP, CASC, etc.

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Sigma: An integrated development environment for formal ontology

AI Communications - Intelligent Engineering Techniques for Knowledge Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Numerous classical and non-classical logics can be elegantly embedded in Church's simple type theory, also known as classical higher-order logic. Examples include propositional and quantified multimodal logics, intuitionistic logics, logics for security, and logics for spatial reasoning. 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 embedded logics and logics combinations. In this article we focus on combinations of (quantified) epistemic and doxastic logics and study their application for modeling and automating the reasoning of rational agents. We present illustrating example problems and report on experiments with off-the-shelf higher-order automated theorem provers.