Sciweavers

11 search results - page 1 / 3
» Semantic Minimization of 3-Valued Propositional Formulae
Sort
View
LICS
2002
IEEE
13 years 9 months ago
Semantic Minimization of 3-Valued Propositional Formulae
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 obtainin...
Thomas W. Reps, Alexey Loginov, Shmuel Sagiv
AAAI
1998
13 years 6 months ago
A Non-Deterministic Semantics for Tractable Inference
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
James M. Crawford, David W. Etherington
LICS
2005
IEEE
13 years 10 months ago
Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...
Patrice Godefroid, Michael Huth
SPLC
2007
13 years 5 months ago
Feature Diagrams and Logics: There and Back Again
Feature modeling is a notation and an approach for modeling commonality and variability in product families. In their basic form, feature models contain mandatory/optional feature...
Krzysztof Czarnecki, Andrzej Wasowski
FSTTCS
2006
Springer
13 years 8 months ago
Monitoring of Real-Time Properties
This paper presents a construction for runtime monitors that check real-time properties expressed in timed LTL (TLTL). Due to D'Souza's results, TLTL can be considered a ...
Andreas Bauer 0002, Martin Leucker, Christian Scha...