Tableau calculus for preference-based conditional logics: PCL and its extensions

Laura Giordano; Valentina Gliozzi; Nicola Olivetti; Camilla Schwind

doi:10.1145/1507244.1507251

Tableau calculus for preference-based conditional logics: PCL and its extensions

Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Camilla Schwind

Department of Science and Technological Innovation

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

Abstract

We present a tableau calculus for some fundamental systems of propositional conditional logics. We consider the conditional logics that can be characterized by preferential semantics (i.e., possible world structures equipped with a family of preference relations). For these logics, we provide a uniform completeness proof of the axiomatization with respect to the semantics, and a uniform labeled tableau procedure.

Original language	English
Article number	21
Journal	ACM Transactions on Computational Logic
Volume	10
Issue number	3
DOIs	https://doi.org/10.1145/1507244.1507251
Publication status	Published - 1 Apr 2009

Keywords

Conditional logics
Tableaux calculi

Access to Document

10.1145/1507244.1507251

Cite this

@article{b588adc9844c4c9db7367639d5e888ab,

title = "Tableau calculus for preference-based conditional logics: PCL and its extensions",

abstract = "We present a tableau calculus for some fundamental systems of propositional conditional logics. We consider the conditional logics that can be characterized by preferential semantics (i.e., possible world structures equipped with a family of preference relations). For these logics, we provide a uniform completeness proof of the axiomatization with respect to the semantics, and a uniform labeled tableau procedure.",

keywords = "Conditional logics, Tableaux calculi",

author = "Laura Giordano and Valentina Gliozzi and Nicola Olivetti and Camilla Schwind",

year = "2009",

month = apr,

day = "1",

doi = "10.1145/1507244.1507251",

language = "English",

volume = "10",

journal = "ACM Transactions on Computational Logic",

issn = "1529-3785",

publisher = "Association for Computing Machinery (ACM)",

number = "3",

}

TY - JOUR

T1 - Tableau calculus for preference-based conditional logics

T2 - PCL and its extensions

AU - Giordano, Laura

AU - Gliozzi, Valentina

AU - Olivetti, Nicola

AU - Schwind, Camilla

PY - 2009/4/1

Y1 - 2009/4/1

N2 - We present a tableau calculus for some fundamental systems of propositional conditional logics. We consider the conditional logics that can be characterized by preferential semantics (i.e., possible world structures equipped with a family of preference relations). For these logics, we provide a uniform completeness proof of the axiomatization with respect to the semantics, and a uniform labeled tableau procedure.

AB - We present a tableau calculus for some fundamental systems of propositional conditional logics. We consider the conditional logics that can be characterized by preferential semantics (i.e., possible world structures equipped with a family of preference relations). For these logics, we provide a uniform completeness proof of the axiomatization with respect to the semantics, and a uniform labeled tableau procedure.

KW - Conditional logics

KW - Tableaux calculi

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

U2 - 10.1145/1507244.1507251

DO - 10.1145/1507244.1507251

M3 - Article

SN - 1529-3785

VL - 10

JO - ACM Transactions on Computational Logic

JF - ACM Transactions on Computational Logic

IS - 3

M1 - 21

ER -

Tableau calculus for preference-based conditional logics: PCL and its extensions

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this