Results 1  10
of
169,829
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
situations, applications to grouped, censored or truncated data, finite mixture models, variance component estimation, hyperparameter estimation, iteratively reweighted least squares and factor analysis.
Splittings and the finite model property
 Journal of Symbolic Logic
, 1993
"... An old and conjecture of modal logics states that every splitting of the major systems K4, S4 and Grz has the finite model property. In this paper we will prove that all iterated splittings of G have fmp, whereas in the other cases we will give explicit counterexamples. We also introduce a proof tec ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
An old and conjecture of modal logics states that every splitting of the major systems K4, S4 and Grz has the finite model property. In this paper we will prove that all iterated splittings of G have fmp, whereas in the other cases we will give explicit counterexamples. We also introduce a proof
Preservation by fibring of the finite model property
 Journal of Logic and Computation
"... Capitalising on the graphtheoretic account of fibring proposed in [31], we show that fibring preserves the finite model property under mild conditions. Illustrations are provided for modal, deontic, paraconsistent and linear logics. ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Capitalising on the graphtheoretic account of fibring proposed in [31], we show that fibring preserves the finite model property under mild conditions. Illustrations are provided for modal, deontic, paraconsistent and linear logics.
Finite model property for guarded fragments
"... Thanks to the organisers for the setting and for inviting me. Outline I aim to prove that some guarded fragments of firstorder logic have the finite model property. This is not a survey of guarded fragments. I’ll concentrate on proofs. 1. ..."
Abstract
 Add to MetaCart
Thanks to the organisers for the setting and for inviting me. Outline I aim to prove that some guarded fragments of firstorder logic have the finite model property. This is not a survey of guarded fragments. I’ll concentrate on proofs. 1.
The finite model property in tense logic
 Journal of Symbolic Logic
, 1995
"... Abstract Tense logics in the bimodal propositional language are investigated with respect to the Finite Model Property (FMP). In order to prove positive results techniques from investigations of modal logics above K4 are extended to tense logic. General negative results show the limits of this trans ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
Abstract Tense logics in the bimodal propositional language are investigated with respect to the Finite Model Property (FMP). In order to prove positive results techniques from investigations of modal logics above K4 are extended to tense logic. General negative results show the limits
Finitization Procedures and Finite Model Property.
"... Investigations into the Relevant and Paraconsistent model theory of rstorder arithmetic have provided interesting new methods and results which have revived the interest in Hilbert's program. The attempt to develop Strict Finitist Mathematics using G. Priest's Collapsing lemma to nitize ..."
Abstract
 Add to MetaCart
to nitize innite models is an example. In the investigation of some systems of Relevant Logics, another nitization procedure is used to solve positively their decision problem and to prove the nite model property for these systems. Some results related to the procedure used in these investigations show
THE FINITE MODEL PROPERTY FOR THE VARIETY OF HEYTING ALGEBRAS WITH SUCCESSOR
"... Abstract. The finite model property of the variety of Salgebras was proved by X. Caicedo using Kripke model techniques of the associated calculus. A more algebraic proof, but still strongly based on Kripke model ideas, was given by Muravitskii. In this article we give a purely algebraic proof for t ..."
Abstract
 Add to MetaCart
Abstract. The finite model property of the variety of Salgebras was proved by X. Caicedo using Kripke model techniques of the associated calculus. A more algebraic proof, but still strongly based on Kripke model ideas, was given by Muravitskii. In this article we give a purely algebraic proof
Skolemization in intermediate logics with the finite model property
"... Abstract An alternative Skolemization method, which removes strong quantifiers from formulas, is presented that is sound and complete with respect to intermediate predicate logics with the finite model property. For logics without constant domains the method makes use of an existence predicate, whi ..."
Abstract
 Add to MetaCart
Abstract An alternative Skolemization method, which removes strong quantifiers from formulas, is presented that is sound and complete with respect to intermediate predicate logics with the finite model property. For logics without constant domains the method makes use of an existence predicate
Decidability and Finite Model Property of Substructural Logics
 In The Tbilisi Symposium on Logic, Language and Computation
, 1998
"... this paper, we will give a short survey of results on decision problems and the finite model property of substructural logics. The paper is far from a complete list of these results, since a lot of results have been obtained already in some restricted classes of substructural logics, like relevant l ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
this paper, we will give a short survey of results on decision problems and the finite model property of substructural logics. The paper is far from a complete list of these results, since a lot of results have been obtained already in some restricted classes of substructural logics, like relevant
On the Finite Model Property in OrderSorted Logic
"... Abstract. The SchoenfinkelBernaysRamsey class is a fragment of firstorder logic with the Finite Model Property: a sentence in this class is satisfiable if and only if it is satisfied in a finite model. Since an upper bound on the size of such a model is computable from the sentence, the satisfiab ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The SchoenfinkelBernaysRamsey class is a fragment of firstorder logic with the Finite Model Property: a sentence in this class is satisfiable if and only if it is satisfied in a finite model. Since an upper bound on the size of such a model is computable from the sentence
Results 1  10
of
169,829