Embedding and automating conditional logics in classical higher-order logic

Christoph Benzmüller; Dov Gabbay; Valerio Genovese; Daniele Rispoli

doi:10.1007/s10472-012-9320-z

Embedding and automating conditional logics in classical higher-order logic

Christoph Benzmüller, Dov Gabbay, Valerio Genovese, Daniele Rispoli

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

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	https://doi.org/10.1007/s10472-012-9320-z
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.

Keywords

Automated theorem proving
Classical higher-order logic
Conditional logics
Semantic embedding

Access to Document

10.1007/s10472-012-9320-z

Cite this

@article{3d7332cc9732425baea6a25d2ac77b09,

title = "Embedding and automating conditional logics in classical higher-order logic",

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.",

keywords = "Automated theorem proving, Classical higher-order logic, Conditional logics, Semantic embedding",

author = "Christoph Benzm{\"u}ller and Dov Gabbay and Valerio Genovese and Daniele Rispoli",

note = "Funding Information: C. Benzm{\"u}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.",

year = "2012",

month = dec,

doi = "10.1007/s10472-012-9320-z",

language = "אנגלית",

volume = "66",

pages = "257--271",

journal = "Annals of Mathematics and Artificial Intelligence",

issn = "1012-2443",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Embedding and automating conditional logics in classical higher-order logic

AU - Benzmüller, Christoph

AU - Gabbay, Dov

AU - Genovese, Valerio

AU - Rispoli, Daniele

N1 - 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.

PY - 2012/12

Y1 - 2012/12

N2 - 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.

AB - 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.

KW - Automated theorem proving

KW - Classical higher-order logic

KW - Conditional logics

KW - Semantic embedding

UR - http://www.scopus.com/inward/record.url?scp=84871182322&partnerID=8YFLogxK

U2 - 10.1007/s10472-012-9320-z

DO - 10.1007/s10472-012-9320-z

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84871182322

SN - 1012-2443

VL - 66

SP - 257

EP - 271

JO - Annals of Mathematics and Artificial Intelligence

JF - Annals of Mathematics and Artificial Intelligence

IS - 1

ER -

Embedding and automating conditional logics in classical higher-order logic

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this