Results 1 - 10 of 133

Well-Founded Semantics Coincides with Three-Valued Stable Semantics

by Teodor Przymusinski - FUNDAMENTA INFORMATICAE , 1990
"... We introduce 3-valued stable models which are a natural generalization of standard (2-valued) stable models. We show that every logic program P has at least one 3-valued stable model and that the wellfounded model of any program P [VGRS90] coincides with the smallest 3-valued stable model of P. We c ..."
Abstract - Cited by 155 (15 self) - Add to MetaCart
We introduce 3-valued stable models which are a natural generalization of standard (2-valued) stable models. We show that every logic program P has at least one 3-valued stable model and that the wellfounded model of any program P [VGRS90] coincides with the smallest 3-valued stable model of P. We

Three-valued automated reasoning . . .

by R. Gentilini, K. Schneider, A. Dreyer , 2007
"... We deal with the problem of designing suitable languages for the modeling and the automatic verification of proper-ties over analog circuits. To this purpose, we suitably en-rich classical temporal logics with basic formulæ allowing to model arbitrary functions relating analog variables. We show ho ..."
Abstract - Add to MetaCart
We deal with the problem of designing suitable languages for the modeling and the automatic verification of proper-ties over analog circuits. To this purpose, we suitably en-rich classical temporal logics with basic formulæ allowing to model arbitrary functions relating analog variables. We show

Three-Valued Spotlight Abstractions

by Jonas Schrieb, Heike Wehrheim, Daniel Wonisch
"... Abstract. Spotlight abstractions in verification focus on one specific component in a parallel system while disregarding most information about the rest. Existing spotlight abstractions are either based on over- or on underapproximations of the parallel system, thus either preserving existential or ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
on top of an existing three-valued model checker. Experimental results show that our technique can outperform existing predicate abstraction tools on certain classes of parallel systems. 1

Modal Transition Systems: A Foundation for Three-Valued Program Analysis

by Michael Huth, Radha Jagadeesan, David A. Schmidt , 2000
"... . We present Kripke modal transition systems (Kripke MTSs), a generalization of modal transition systems [25, 24], as a foundation for three-valued program analysis. The semantics of Kripke MTSs are presented by means of a mixed power domain of states; soundness and consistency are proved. Two major ..."
Abstract - Cited by 116 (21 self) - Add to MetaCart
major applications, model checking partial state spaces and three-valued program shape analysis, are presented as evidence of the suitability of Kripke MTSs as a foundation for threevalued analyses. 1 Introduction Specification and analysis models are inherently uncertain---the non

Three-valued Logics in Modal Logic

by Barteld Kooi, Allard Tamminga
"... Abstract. Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-valued logic into a modal formula. S ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
. Second, we show that for every S5-model there is an equivalent three-valued valuation and vice versa. In general, our Translation Manual gives rise to translations that are exponentially longer than their originals. This fact raises the question whether there are three-valued logics for which there is a

Three-valued abstraction for probabilistic systems

by Joost-pieter Katoen - Journal of Logic and Algebraic Programming, 81(4):356 – 389 , 2012
"... Probabilistic model checking enjoys a rapid increase of interest from different communities. Software tools such as PRISM [13] (with about 4,000 downloads), MRMC [12], and LiQuor [2] support the verification of Markov chains or variants thereof that exhibit nondeterminism. They have been applied to ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
Probabilistic model checking enjoys a rapid increase of interest from different communities. Software tools such as PRISM [13] (with about 4,000 downloads), MRMC [12], and LiQuor [2] support the verification of Markov chains or variants thereof that exhibit nondeterminism. They have been applied

Probabilistic Inference on Three-Valued Logic

by Guilin Qi - Proceedings of 9th International Conferece on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing (RSFDGrc’2003 , 2003
"... In this paper, we extend Nilsson's probabilistic logic [1] to allow that each sentence S has three sets of possible worlds. We adopt the ideas of consistency and possible worlds introduced by Nilsson in [1], but propose a new method called linear equation method to deal with the problems of ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
of probabilistic inference, the results of our method is consistent with those of Yao's interval-set model method.

Three-valued abstraction for continuous-time markov chains

by Joost-pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf - In Proceedings of the International Conference on Computer Aided Verification , 2007
"... Abstract. This paper proposes a novel abstraction technique for continuous-time Markov chains (CTMCs). Our technique fits within the realm of three-valued abstraction methods that have been used successfully for traditional model checking. The key idea is to apply abstraction on uniform CTMCs that a ..."
Abstract - Cited by 36 (8 self) - Add to MetaCart
Abstract. This paper proposes a novel abstraction technique for continuous-time Markov chains (CTMCs). Our technique fits within the realm of three-valued abstraction methods that have been used successfully for traditional model checking. The key idea is to apply abstraction on uniform CTMCs

Three-valued logic in bounded model checking

by Tobias Schuele, Klaus Schneider - In Formal Methods and Models for Codesign (MEMOCODE , 2005
"... In principle, bounded model checking (BMC) leads to semi-decision procedures that can be used to verify liveness prop-erties and to falsify safety properties. If the procedures fail, there is usually no information about the validity of the con-sidered specification. In this paper, we present a new ..."
Abstract - Cited by 7 (5 self) - Add to MetaCart
ap-proach to BMC based on three-valued logic that allows us in many cases to falsify liveness properties and to verify safety properties. Moreover, we employ both global and lo-cal model checking to take advantage of the different types of specifications that can be handled by these techniques. 1.

Characterizations of Classes of Programs by Three-Valued Operators

by Pascal Hitzler, Anthony Karel Seda , 1999
"... . Several important classes of normal logic programs, including the classes of acyclic, acceptable, and locally hierarchical programs, have the property that every program in the class has a unique twovalued supported model. In this paper, we call such classes unique supported model classes. We ..."
Abstract - Cited by 27 (26 self) - Add to MetaCart
analyse and characterize these classes by means of operators on three-valued logics. Our studies will motivate the definition of a larger unique supported model class which we call the class of \Phi -accessible programs. Finally, we show that the class of \Phi -accessible programs is computationally
Results 1 - 10 of 133