Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

LICS
2002
IEEE

favoriteEmaildiscussreport

92views Automated Reasoning» more LICS 2002»

Semantic Minimization of 3-Valued Propositional Formulae

13 years 9 months ago

Semantic Minimization of 3-Valued Propositional Formulae

Download www.cs.wisc.edu

This paper presents an algorithm for a non-standard logicminimization problem that arises in £ -valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use £ -valued logic. An answer of ¤ or ¥ provides precise (deﬁnite) information; an answer of ¥§¦©¨ provides imprecise (indeﬁnite) 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-deﬁned sense).

Thomas W. Reps, Alexey Loginov, Shmuel Sagiv

Real-time Traffic

-valued Propositional Logic | Automated Reasoning | Better Answers | LICS 2002 | Non-standard Logicminimization Problem |

claim paper

Related Content

» A NonDeterministic Semantics for Tractable Inference

» Model Checking Vs Generalized Model Checking Semantic Minimizations for Temporal Logics

» Feature Diagrams and Logics There and Back Again

» Monitoring of RealTime Properties

» Model Checking Quantified Computation Tree Logic

» A Default Approach to Semantics of Logic Programs with Constraint Atoms

» Firstorder Logic Modality and Intensionality

» Closeness and Distance Relations in Order of Magnitude Qualitative Reasoning via PDL

» Sampling and Soundness Can We Have Both

Post Info
More Details (n/a)

Added	15 Jul 2010
Updated	15 Jul 2010
Type	Conference
Year	2002
Where	LICS
Authors	Thomas W. Reps, Alexey Loginov, Shmuel Sagiv

Comments (0)