2000 character limit reached
Automating Quantified Multimodal Logics in Simple Type Theory -- A Case Study
Published 27 May 2009 in cs.AI and cs.LO | (0905.4369v1)
Abstract: In a case study we investigate whether off the shelf higher-order theorem provers and model generators can be employed to automate reasoning in and about quantified multimodal logics. In our experiments we exploit the new TPTP infrastructure for classical higher-order logic.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.