Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
8,631
Maximum likelihood from incomplete data via the EM algorithm
- JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B
, 1977
"... A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value situat ..."
Abstract
-
Cited by 11972 (17 self)
- Add to MetaCart
A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value
A Simple Modal Encoding of Propositional Finite Many-Valued Logics
"... We present a method for testing the validity for any finite many-valued logic by using simple transformations into the validity problem for von Wright’s logic of elsewhere. The method provides a new origi-nal viewpoint on finite many-valuedness. Indeed, we present a uniform modal encoding of any fin ..."
Abstract
- Add to MetaCart
We present a method for testing the validity for any finite many-valued logic by using simple transformations into the validity problem for von Wright’s logic of elsewhere. The method provides a new origi-nal viewpoint on finite many-valuedness. Indeed, we present a uniform modal encoding of any
Proof theory for locally finite many-valued logics: semi-projective logics
, 2013
"... We extend the methodology in [5] to systematically construct analytic calculi for semi-projective logics – a large family of (propositional) locally finite many-valued logics. Our calculi, defined in the framework of sequents of relations, are proof search oriented and can be used to settle the comp ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
We extend the methodology in [5] to systematically construct analytic calculi for semi-projective logics – a large family of (propositional) locally finite many-valued logics. Our calculi, defined in the framework of sequents of relations, are proof search oriented and can be used to settle
Many-Valued Modal Logics
- Fundamenta Informaticae
, 1992
"... . Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds a ..."
Abstract
-
Cited by 273 (16 self)
- Add to MetaCart
. Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds
Bilattices and the Semantics of Logic Programming
, 1989
"... Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap's four-valued logic, based on classical two-valued logic. Among other examples are those based on finite many-valued logics, and on prob ..."
Abstract
-
Cited by 446 (13 self)
- Add to MetaCart
Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap's four-valued logic, based on classical two-valued logic. Among other examples are those based on finite many-valued logics
Automatic verification of finite-state concurrent systems using temporal logic specifications
- ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract
-
Cited by 1388 (62 self)
- Add to MetaCart
We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Dyadic Semantics for Many-Valued Logics
, 2003
"... This paper obtains an effective method which assigns two-valued semantics to every finite-valued truth-functional logic (in the direction of the so-called "Suszko's Thesis"), provided that its truth-values can be individualized by means of its linguistic resources. Such two-valued sem ..."
Abstract
-
Cited by 8 (5 self)
- Add to MetaCart
semantics permit us to obtain new tableau proof systems for a wide class of finite-valued logics, including the main many-valued paraconsistent logics.
Expressive Three-valued . . .
, 2006
"... The expressive truth functions of two-valued logic have all been characterized, as have the expressive unary truth functions of finitely-many-valued logic. This paper introduces some techniques for identifying expressive functions in three-valued logics. ..."
Abstract
- Add to MetaCart
The expressive truth functions of two-valued logic have all been characterized, as have the expressive unary truth functions of finitely-many-valued logic. This paper introduces some techniques for identifying expressive functions in three-valued logics.
Bernoulli automorphisms in many-valued logic
, 2004
"... In classical propositional logic over finitely many variables no automorphism has any stochastic property, because the dual space is a finite discrete set. In this paper we show that the situation for the infinite-valued ̷Lukasiewicz logic is radically different, by exhibiting a family of Bernoull ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
In classical propositional logic over finitely many variables no automorphism has any stochastic property, because the dual space is a finite discrete set. In this paper we show that the situation for the infinite-valued ̷Lukasiewicz logic is radically different, by exhibiting a family
Results 1 - 10
of
8,631
