logo
    Incompletely Specified Probabilistic Networks
    Journal of Management Information Systems (1995)
    Stephen F. Roehrig
    11
    Citation
    33
    Reference
    10
    Related Paper
    Citation Trend
    Abstract:
    :Probabilistic networks, used as an adjunct or alternative to the logical models used in artificial intelligence (AI) and decision support systems (DSS), offer a way to compactly represent a distribution over a set of random variables. Nonetheless, the specification of a given network may require conditional probabilities that are simply unavailable. In this paper a means for analyzing incompletely specified networks is presented, and some general rules are derived from the application of the method to some simple networks. The use of the technique in MIS settings is illustrated.
    Topics:
    Bayesian Modeling and Causal Inference
    Logic, Reasoning, and Knowledge
    AI-based Problem Solving and Planning
    Verification of multiprocess probabilistic protocols
    Distributed Computing (1986)
    Amir PnueliLenore D. Zuck
    Granularity
    Probabilistic CTL
    Abstraction
    Citations (120)
    New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces
    Discrete Geometry for Computer Imagery (2008)
    Michel CouprieGilles Bertrand
    In this article, we present new results on simple points, minimal non-simple sets (MNS) and P-simple points. In particular, we propose new characterizations which hold in dimensions 2, 3 and 4, and which lead to efficient algorithms for detecting such points or sets. This work is settled in the framework of cubical complexes, and some of the main results are based on the properties of critical kernels.
    SIMPLE algorithm
    Citations (6)
    Simple endotrivial modules for quasi-simple groups
    arXiv (Cornell University) (2013)
    Caroline LassueurGunter MalleElisabeth Schulte
    We investigate simple endotrivial modules of finite quasi-simple groups and classify them in several important cases. This is motivated by a recent result of Robinson showing that simple endotrivial modules of most groups come from quasi-simple groups.
    Citations (0)
    Simple endotrivial modules for quasi-simple groups
    Journal für die reine und angewandte Mathematik (Crelles Journal) (2013)
    Caroline LassueurGunter MalleElisabeth Schulte
    Abstract We investigate simple endotrivial modules of finite quasi-simple groups and classify them in several important cases. This is motivated by a recent result of Robinson [Bull. Lond. Math. Soc. 43 (2011), 712–716] showing that simple endotrivial modules of most groups come from quasi-simple groups.
    Citations (30)
    Book Review: IV. Pastorial — Practical Studies: Simple Sermons for Times like These, Simple Sermons on Evangelistic Themes, Simple Talks for Christian Workers, Simple Sermons on Prophetic Themes, Simple Sermons about Jesus Christ, Simple Sermons on Heaven, Hell, and Judgment, Simple Sermons on the Ten Commandments, Simple Sermons for a Sinful Age, Simple Sermons on the Seven Churches of Revelation
    Review & Expositor (1975)
    James W. Cox
    Citations (0)
    Fundamental relations in simple and 0-simple semihypergroups of small size
    Arabian Journal of Mathematics (2012)
    Dario FasinoDomenico Freni
    We consider the fundamental relations β and γ in simple and 0-simple semihypergroups, especially in connection with certain minimal cardinality questions. In particular, we enumerate and exhibit all simple and 0-simple semihypergroups having order 3 where β is not transitive, apart of isomorphisms. Moreover, we show that the least order for which there exists a strongly simple semihypergroup where β is not transitive is 4. Finally, we prove that γ is transitive in all simple semihypergroups, and determine necessary and sufficient conditions for a 0-simple semihypergroup to have γ transitive. The latter results obviously hold also for simple and 0-simple semigroups.
    Cardinality (data modeling)
    Existential quantification
    Citations (8)
    On the Representation of Probabilities over Structured Domains
    Lecture notes in computer science (1999)
    Marius BozgaOded Maler
    Binary decision diagram
    Representation
    Probabilistic relevance model
    Probabilistic CTL
    Citations (56)
    The [0-Simple] Simple Subsemigroups of Nonnegative Matrices
    Journal of Mathematical Research and Exposition (2000)
    Qian Shuang-ping
    In this paper, we investigate the properties of the [0-simple] simple subsemigroups of nonnegative matrices and show that the [0-simple] simple subsemigroups of Mn(S) are completely [0-simple] simple, where S is a strong ideal subset of R+ which has no ele- ments less than 1 except 0. Finally, we illustrate that the semigroup of nonnegative matriles is interesting.
    Citations (0)
    Don’t Know in Probabilistic Systems
    Lecture notes in computer science (2006)
    Harald FecherMartin LeuckerVerena Wolf
    Probabilistic CTL
    Abstraction
    Probabilistic relevance model
    Citations (100)
    Simple endotrivial modules for quasi-simple groups
    arXiv (Cornell University) (2013)
    Caroline LassueurGunter MalleElisabeth Schulte
    We investigate simple endotrivial modules of finite quasi-simple groups and classify them in several important cases. This is motivated by a recent result of Robinson showing that simple endotrivial modules of most groups come from quasi-simple groups.
    Citations (4)