Operational Causality – Necessarily Sufficient and Sufficiently Necessary

Christel Baier; Clemens Dubslaff; Florian Funke; Simon Jantsch; Jakob Piribauer; Robin Ziemek

doi:10.1007/978-3-031-15629-8_2

Operational Causality – Necessarily Sufficient and Sufficiently Necessary

Christel Baier, Clemens Dubslaff, Florian Funke, Simon Jantsch, Jakob Piribauer, Robin Ziemek

Technische Universität Dresden

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

2 Scopus citations

Abstract

Necessity and sufficiency are well-established notions in logic and causality analysis, but have barely received attention in the formal methods community. In this paper, we present temporal logic characterizations of necessary and sufficient causes in terms of state sets in operational system models. We introduce degrees of necessity and sufficiency as quality measures for sufficient and necessary causes, respectively, along with a versatile weight-based approach to find “good causes”. The resulting optimization problems of finding optimal causes are shown to be solvable in polynomial time.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	27-45
Number of pages	19
DOIs	https://doi.org/10.1007/978-3-031-15629-8_2
State	Published - 2022
Externally published	Yes

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13560 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/978-3-031-15629-8_2

Cite this

Baier, C., Dubslaff, C., Funke, F., Jantsch, S., Piribauer, J., & Ziemek, R. (2022). Operational Causality – Necessarily Sufficient and Sufficiently Necessary. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 27-45). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13560 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-15629-8_2

Baier, Christel ; Dubslaff, Clemens ; Funke, Florian et al. / Operational Causality – Necessarily Sufficient and Sufficiently Necessary. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH, 2022. pp. 27-45 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{1425f9a414de496c85e1d1685b012f00,

title = "Operational Causality – Necessarily Sufficient and Sufficiently Necessary",

abstract = "Necessity and sufficiency are well-established notions in logic and causality analysis, but have barely received attention in the formal methods community. In this paper, we present temporal logic characterizations of necessary and sufficient causes in terms of state sets in operational system models. We introduce degrees of necessity and sufficiency as quality measures for sufficient and necessary causes, respectively, along with a versatile weight-based approach to find “good causes”. The resulting optimization problems of finding optimal causes are shown to be solvable in polynomial time.",

author = "Christel Baier and Clemens Dubslaff and Florian Funke and Simon Jantsch and Jakob Piribauer and Robin Ziemek",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.",

year = "2022",

doi = "10.1007/978-3-031-15629-8_2",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "27--45",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

Baier, C, Dubslaff, C, Funke, F, Jantsch, S, Piribauer, J & Ziemek, R 2022, Operational Causality – Necessarily Sufficient and Sufficiently Necessary. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13560 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 27-45. https://doi.org/10.1007/978-3-031-15629-8_2

Operational Causality – Necessarily Sufficient and Sufficiently Necessary. / Baier, Christel; Dubslaff, Clemens; Funke, Florian et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH, 2022. p. 27-45 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13560 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Operational Causality – Necessarily Sufficient and Sufficiently Necessary

AU - Baier, Christel

AU - Dubslaff, Clemens

AU - Funke, Florian

AU - Jantsch, Simon

AU - Piribauer, Jakob

AU - Ziemek, Robin

PY - 2022

Y1 - 2022

N2 - Necessity and sufficiency are well-established notions in logic and causality analysis, but have barely received attention in the formal methods community. In this paper, we present temporal logic characterizations of necessary and sufficient causes in terms of state sets in operational system models. We introduce degrees of necessity and sufficiency as quality measures for sufficient and necessary causes, respectively, along with a versatile weight-based approach to find “good causes”. The resulting optimization problems of finding optimal causes are shown to be solvable in polynomial time.

AB - Necessity and sufficiency are well-established notions in logic and causality analysis, but have barely received attention in the formal methods community. In this paper, we present temporal logic characterizations of necessary and sufficient causes in terms of state sets in operational system models. We introduce degrees of necessity and sufficiency as quality measures for sufficient and necessary causes, respectively, along with a versatile weight-based approach to find “good causes”. The resulting optimization problems of finding optimal causes are shown to be solvable in polynomial time.

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

U2 - 10.1007/978-3-031-15629-8_2

DO - 10.1007/978-3-031-15629-8_2

M3 - Chapter

AN - SCOPUS:85138174451

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 27

EP - 45

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Science and Business Media Deutschland GmbH

ER -

Baier C, Dubslaff C, Funke F, Jantsch S, Piribauer J, Ziemek R. Operational Causality – Necessarily Sufficient and Sufficiently Necessary. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH. 2022. p. 27-45. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-15629-8_2

Operational Causality – Necessarily Sufficient and Sufficiently Necessary

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this