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.
| Original language | English |
|---|---|
| Pages (from-to) | 257-271 |
| Number of pages | 15 |
| Journal | Annals of Mathematics and Artificial Intelligence |
| Volume | 66 |
| Issue number | 1 |
| DOIs | |
| State | Published - Dec 2012 |
| Externally published | Yes |
Bibliographical note
Funding 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.
Funding
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.
| Funders | Funder number |
|---|---|
| Deutsche Forschungsgemeinschaft | BE 2501/9-1, BE 2501/8-1 |
| Fonds National de la Recherche Luxembourg |
Keywords
- Automated theorem proving
- Classical higher-order logic
- Conditional logics
- Semantic embedding
Fingerprint
Dive into the research topics of 'Embedding and automating conditional logics in classical higher-order logic'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver