2000 character limit reached
Embedding and Automating Conditional Logics in Classical Higher-Order Logic
Published 18 Jun 2011 in cs.AI, cs.LO, and math.LO | (1106.3685v3)
Abstract: A sound and complete embedding of conditional logics into classical higher-order logic is presented. This embedding enables the application of off-the-shelf higher-order automated theorem provers and model finders for reasoning within and about conditional logics.
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.