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.
|Number of pages||15|
|Journal||Annals of Mathematics and Artificial Intelligence|
|State||Published - Dec 2012|
Bibliographical noteFunding Information:
C. Benzmüller has been supported by the German Research Foundation under grants BE 2501/8-1 and BE 2501/9-1. Valerio Genovese is supported by the National Research Fund, Luxembourg.
- Automated theorem proving
- Classical higher-order logic
- Conditional logics
- Semantic embedding