Structural contradictions

Cindy Eisner; Dana Fisman

doi:10.1007/978-3-642-01702-5_17

Structural contradictions

Cindy Eisner, Dana Fisman

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

2 Scopus citations

Abstract

We study the relation between logical contradictions such as p Λ ¬p and structural contradictions such as p ∩ (p q). Intuitively, we expect the two to be treated similarly, but they are not by PSL, nor by SVA. We provide a solution that treats both kinds of contradictions in a consistent manner. The solution reveals that not all structural contradictions are created equal: we must distinguish between them in order to preserve important characteristics of the logic. A happy result of our solution is that it provides the semantics over the natural alphabet 2 ^P , as opposed to the current semantics of PSL/SVA that use an inflated alphabet including the cryptic letters ⊤ and ⊥. We show that the complexity of model checking PSL/SVA is not affected by our proposed semantics.

Original language	English
Title of host publication	Hardware and Software
Subtitle of host publication	Verification and Testing - 4th International Haifa Verification Conference, HVC 2008, Proceedings
Pages	164-178
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-01702-5_17
State	Published - 17 Jul 2009
Externally published	Yes
Event	4th International Haifa Verification Conference, HVC 2008 - Haifa, Israel Duration: 27 Oct 2008 → 30 Oct 2008

Publication series

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

Conference

Conference	4th International Haifa Verification Conference, HVC 2008
Country/Territory	Israel
City	Haifa
Period	27/10/08 → 30/10/08

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science (all)

Access to Document

10.1007/978-3-642-01702-5_17

Cite this

Eisner, C., & Fisman, D. (2009). Structural contradictions. In Hardware and Software: Verification and Testing - 4th International Haifa Verification Conference, HVC 2008, Proceedings (pp. 164-178). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5394 LNCS). https://doi.org/10.1007/978-3-642-01702-5_17

@inproceedings{9a4c0a8b660748759ee417dc7b97e6f8,

title = "Structural contradictions",

abstract = "We study the relation between logical contradictions such as p Λ ¬p and structural contradictions such as p ∩ (p q). Intuitively, we expect the two to be treated similarly, but they are not by PSL, nor by SVA. We provide a solution that treats both kinds of contradictions in a consistent manner. The solution reveals that not all structural contradictions are created equal: we must distinguish between them in order to preserve important characteristics of the logic. A happy result of our solution is that it provides the semantics over the natural alphabet 2 P , as opposed to the current semantics of PSL/SVA that use an inflated alphabet including the cryptic letters ⊤ and ⊥. We show that the complexity of model checking PSL/SVA is not affected by our proposed semantics.",

author = "Cindy Eisner and Dana Fisman",

year = "2009",

month = jul,

day = "17",

doi = "10.1007/978-3-642-01702-5_17",

language = "English",

isbn = "3642017010",

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

pages = "164--178",

booktitle = "Hardware and Software",

note = "4th International Haifa Verification Conference, HVC 2008 ; Conference date: 27-10-2008 Through 30-10-2008",

}

Eisner, C & Fisman, D 2009, Structural contradictions. in Hardware and Software: Verification and Testing - 4th International Haifa Verification Conference, HVC 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5394 LNCS, pp. 164-178, 4th International Haifa Verification Conference, HVC 2008, Haifa, Israel, 27/10/08. https://doi.org/10.1007/978-3-642-01702-5_17

Structural contradictions. / Eisner, Cindy; Fisman, Dana.
Hardware and Software: Verification and Testing - 4th International Haifa Verification Conference, HVC 2008, Proceedings. 2009. p. 164-178 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5394 LNCS).

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

TY - GEN

T1 - Structural contradictions

AU - Eisner, Cindy

AU - Fisman, Dana

PY - 2009/7/17

Y1 - 2009/7/17

N2 - We study the relation between logical contradictions such as p Λ ¬p and structural contradictions such as p ∩ (p q). Intuitively, we expect the two to be treated similarly, but they are not by PSL, nor by SVA. We provide a solution that treats both kinds of contradictions in a consistent manner. The solution reveals that not all structural contradictions are created equal: we must distinguish between them in order to preserve important characteristics of the logic. A happy result of our solution is that it provides the semantics over the natural alphabet 2 P , as opposed to the current semantics of PSL/SVA that use an inflated alphabet including the cryptic letters ⊤ and ⊥. We show that the complexity of model checking PSL/SVA is not affected by our proposed semantics.

AB - We study the relation between logical contradictions such as p Λ ¬p and structural contradictions such as p ∩ (p q). Intuitively, we expect the two to be treated similarly, but they are not by PSL, nor by SVA. We provide a solution that treats both kinds of contradictions in a consistent manner. The solution reveals that not all structural contradictions are created equal: we must distinguish between them in order to preserve important characteristics of the logic. A happy result of our solution is that it provides the semantics over the natural alphabet 2 P , as opposed to the current semantics of PSL/SVA that use an inflated alphabet including the cryptic letters ⊤ and ⊥. We show that the complexity of model checking PSL/SVA is not affected by our proposed semantics.

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

U2 - 10.1007/978-3-642-01702-5_17

DO - 10.1007/978-3-642-01702-5_17

M3 - Conference contribution

AN - SCOPUS:67650308445

SN - 3642017010

SN - 9783642017018

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

SP - 164

EP - 178

BT - Hardware and Software

T2 - 4th International Haifa Verification Conference, HVC 2008

Y2 - 27 October 2008 through 30 October 2008

ER -

Structural contradictions

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this