This paper deals with chain graphs under the alternative Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP chain graph a given probability distribution is faithful to. We also show that the extension of Meek’s conjecture to AMP chain graphs does not hold, which compromises the development of efficient and correct score+sea...

2. Correspondence Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.1 The Role and Character of Correspondence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.2 Some Constraints on Correspondent Elements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.3 Correspondence Theory an...

Marginal AMP chain graphs are a recently introduced family of models that is based on graphs that may have undirected, directed and bidirected edges. They unify and generalize the AMP and the multivariate regression interpretations of chain graphs. In this paper, we present a constraint based algorithm for learning a marginal AMP chain graph from a probability distribution which is faithful to ...

‎In the present paper‎, ‎we are going to use geometric and topological concepts‎, ‎entities and properties of the‎ ‎integral curves of linear vector fields‎, ‎and the theory of differential equations‎, ‎to establish a representation for some groups on $R^{n} (ngeq 1)$‎. ‎Among other things‎, ‎we investigate the surjectivity and faithfulness of the representation‎. At the end‎, ‎we give some app...

The traditional understanding of analyticity in terms of concept containment is revisited, but with a concept explicitly understood as a certain kind of mental representation and containment being read correspondingly literally. The resulting conception of analyticity avoids much of the vagueness associated with attempts to explicate analyticity in terms of synonymy by moving the locus of discu...