Semantic Minimization of 3-Valued Propositional Formulae

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Thomas Reps Articles by Alexey Loginov Articles by Mooly Sagiv

17th Annual IEEE Symposium on Logic in Computer Science (LICS'02)

Copenhagen, Denmark

July 22-July 25

ISBN: 0-7695-1483-9

	ASCII Text	x
	Thomas Reps, Alexey Loginov, Mooly Sagiv, "Semantic Minimization of 3-Valued Propositional Formulae," Logic in Computer Science, Symposium on, pp. 40, 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002.

	BibTex	x
	@article{ 10.1109/LICS.2002.1029816, author = {Thomas Reps and Alexey Loginov and Mooly Sagiv}, title = {Semantic Minimization of 3-Valued Propositional Formulae}, journal ={Logic in Computer Science, Symposium on}, volume = {0}, year = {2002}, issn = {1043-6871}, pages = {40}, doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2002.1029816}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Logic in Computer Science, Symposium on TI - Semantic Minimization of 3-Valued Propositional Formulae SN - 1043-6871 SP EP A1 - Thomas Reps, A1 - Alexey Loginov, A1 - Mooly Sagiv, PY - 2002 KW - null VL - 0 JA - Logic in Computer Science, Symposium on ER -

Thomas Reps, University of Wisconsin

Alexey Loginov, University of Wisconsin

Mooly Sagiv, Tel-Aviv University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2002.1029816

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 \varphi with a "better" formula \psi, 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).

Citation:

Thomas Reps, Alexey Loginov, Mooly Sagiv, "Semantic Minimization of 3-Valued Propositional Formulae," lics, pp.40, 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.