Results 1  10
of
1,812,715
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 11807 (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 ManyValued Logics
"... We present a method for testing the validity for any finite manyvalued logic by using simple transformations into the validity problem for von Wright’s logic of elsewhere. The method provides a new original viewpoint on finite manyvaluedness. 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 manyvalued logic by using simple transformations into the validity problem for von Wright’s logic of elsewhere. The method provides a new original viewpoint on finite manyvaluedness. Indeed, we present a uniform modal encoding of any
Proof theory for locally finite manyvalued logics: semiprojective logics
, 2013
"... We extend the methodology in [5] to systematically construct analytic calculi for semiprojective logics – a large family of (propositional) locally finite manyvalued 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 semiprojective logics – a large family of (propositional) locally finite manyvalued logics. Our calculi, defined in the framework of sequents of relations, are proof search oriented and can be used to settle
ManyValued Modal Logics
 Fundamenta Informaticae
, 1992
"... . Two families of manyvalued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite manyvalued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds a ..."
Abstract

Cited by 271 (16 self)
 Add to MetaCart
. Two families of manyvalued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite manyvalued 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 fourvalued logic, based on classical twovalued logic. Among other examples are those based on finite manyvalued logics, and on prob ..."
Abstract

Cited by 444 (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 fourvalued logic, based on classical twovalued logic. Among other examples are those based on finite manyvalued logics
Manyvalued logic
 Handbook of Philosophical Logic
, 1986
"... ABSTRACT. This paper discusses the general problem of translation functions between logics, given in axiomatic form, and in particular, the problem of determining when two such logics are “synonymous ” or “translationally equivalent. ” We discuss a proposed formal definition of translational equival ..."
Abstract

Cited by 66 (1 self)
 Add to MetaCart
ABSTRACT. This paper discusses the general problem of translation functions between logics, given in axiomatic form, and in particular, the problem of determining when two such logics are “synonymous ” or “translationally equivalent. ” We discuss a proposed formal definition of translational
A Treatise on ManyValued Logics
 Studies in Logic and Computation
, 2001
"... The paper considers the fundamental notions of many valued logic together with some of the main trends of the recent development of infinite valued systems, often called mathematical fuzzy logics. Besides this logical approach also a more algebraic approach is discussed. And the paper ends with som ..."
Abstract

Cited by 84 (5 self)
 Add to MetaCart
ideas 1.1 From classical to manyvalued logic Logical systems in general are based on some formalized language which includes a notion of well formed formula, and then are determined either semantically or syntactically. That a logical system is semantically determined means that one has a notion
Manyvalued logic and semirings
"... In this paper we describe the relationship between manyvalued logics (in particular Basic logic and ÃLukasiewicz logic) and semirings. We will also give definitions of automata on BLalgebras and MValgebras. 1 ..."
Abstract
 Add to MetaCart
In this paper we describe the relationship between manyvalued logics (in particular Basic logic and ÃLukasiewicz logic) and semirings. We will also give definitions of automata on BLalgebras and MValgebras. 1
Results 1  10
of
1,812,715