Semantic minimization of 3-valued propositional formulae

Thomas Reps; Alexey Loginov; Mooly Sagiv

doi:10.1109/LICS.2002.1029816

Semantic minimization of 3-valued propositional formulae

Thomas Reps, Alexey Loginov, Mooly Sagiv

School of Computer Science

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

Abstract

This paper presents an algorithm for a non-standard logic-minimization problem that arises in 3-valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use 3-valued logic. An answer of 0 or 1 provides precise (definite) information; an answer of 1/2 provides imprecise (indefinite) information. By replacing a formula φ with a "better" formula ψ, we may improve the precision of the answers obtained. In this paper, we give an algorithm that always produces a formula that is "best" (in a certain well-defined sense).

Original language	English
Pages (from-to)	40-51
Number of pages	12
Journal	Proceedings - Symposium on Logic in Computer Science
DOIs	https://doi.org/10.1109/LICS.2002.1029816
State	Published - 2002

Access to Document

10.1109/LICS.2002.1029816

Cite this

@article{abbaddee1d804289aed08b84f662209f,

title = "Semantic minimization of 3-valued propositional formulae",

abstract = "This paper presents an algorithm for a non-standard logic-minimization problem that arises in 3-valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use 3-valued logic. An answer of 0 or 1 provides precise (definite) information; an answer of 1/2 provides imprecise (indefinite) information. By replacing a formula φ with a {"}better{"} formula ψ, we may improve the precision of the answers obtained. In this paper, we give an algorithm that always produces a formula that is {"}best{"} (in a certain well-defined sense).",

author = "Thomas Reps and Alexey Loginov and Mooly Sagiv",

year = "2002",

doi = "10.1109/LICS.2002.1029816",

language = "אנגלית",

pages = "40--51",

journal = "Proceedings - Symposium on Logic in Computer Science",

issn = "1043-6871",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Semantic minimization of 3-valued propositional formulae

AU - Reps, Thomas

AU - Loginov, Alexey

AU - Sagiv, Mooly

PY - 2002

Y1 - 2002

N2 - This paper presents an algorithm for a non-standard logic-minimization problem that arises in 3-valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use 3-valued logic. An answer of 0 or 1 provides precise (definite) information; an answer of 1/2 provides imprecise (indefinite) information. By replacing a formula φ with a "better" formula ψ, we may improve the precision of the answers obtained. In this paper, we give an algorithm that always produces a formula that is "best" (in a certain well-defined sense).

AB - This paper presents an algorithm for a non-standard logic-minimization problem that arises in 3-valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use 3-valued logic. An answer of 0 or 1 provides precise (definite) information; an answer of 1/2 provides imprecise (indefinite) information. By replacing a formula φ with a "better" formula ψ, we may improve the precision of the answers obtained. In this paper, we give an algorithm that always produces a formula that is "best" (in a certain well-defined sense).

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

U2 - 10.1109/LICS.2002.1029816

DO - 10.1109/LICS.2002.1029816

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

AN - SCOPUS:0036051122

SN - 1043-6871

SP - 40

EP - 51

JO - Proceedings - Symposium on Logic in Computer Science

JF - Proceedings - Symposium on Logic in Computer Science

ER -

Semantic minimization of 3-valued propositional formulae

Abstract

Access to Document

Other files and links

Fingerprint

Cite this