Probabilistic Horn abduction and Bayesian networks

DOI10.1016/0004-3702(93)90061-FzbMath0792.68176OpenAlexW2090761873WikidataQ29040142 ScholiaQ29040142MaRDI QIDQ1313950

Publication date: 24 February 1994

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(93)90061-f

zbMATH Keywords

Bayesian networks evidential reasoning probabilistic knowledge Horn-clause abduction representation language

Mathematics Subject Classification ID

Knowledge representation (68T30)

Related Items

Hypothesizing about signaling networks, Distributional logic programming for Bayesian knowledge representation, A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics, Mixed deterministic and probabilistic networks, Learning first-order probabilistic models with combining rules, The distribution semantics for normal programs with function symbols, Probabilistic logic with independence, Probabilistic description logic programs under inheritance with overriding for the semantic Web, Graphical models for imprecise probabilities, MEBN: a language for first-order Bayesian knowledge bases, Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence, Explanations as programs in probabilistic logic programming, Lifted Variable Elimination for Probabilistic Logic Programming, Exploiting case-based independence for approximating marginal probabilities, The effect of combination functions on the complexity of relational Bayesian networks, Representing diagnosis knowledge, Oblivious bounds on the probability of boolean functions, PR-OWL - a language for defining probabilistic ontologies, Super-Solutions, The independent choice logic for modelling multiple agents under uncertainty, Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks, Forecasting with jury-based probabilistic argumentation, Fifty Years of Prolog and Beyond, Lower complexity bounds for lifted inference, Probabilistic (logic) programming concepts, Implicitly preserving semantics during incremental knowledge base acquisition under uncertainty., Constraint-based probabilistic modeling for statistical abduction, Semantics and complexity of abduction from default theories, Quantitative pharmacophore models with inductive logic programming, Reference classes and relational learning, The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference, ILP turns 20. Biography and future challenges, Gradient-based boosting for statistical relational learning: the relational dependency network case, The complexity of Bayesian networks specified by propositional and relational languages, Counting Complexity of Minimal Cardinality and Minimal Weight Abduction, A proof theoretic approach to qualitative probabilistic reasoning, Comparison of multiagent inference methods in multiply sectioned Bayesian networks., An evaluation of probabilistic approaches to inference to the best explanation, PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control, On the complexity of inference about probabilistic relational models, Case-factor diagrams for structured probabilistic modeling, Answering queries from context-sensitive probabilistic knowledge bases, A semantics for hybrid probabilistic logic programs with function symbols, Uses and computation of imprecise probabilities from statistical data and expert arguments, A Survey of First-Order Probabilistic Models, Inference in probabilistic logic programs with continuous random variables, On the complexity of propositional and relational credal networks, Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities, Speeding up parameter and rule learning for acyclic probabilistic logic programs, Propagation Nets, Weighted argument systems: basic definitions, algorithms, and complexity results, A Survey of Directed Entity-Relation--Based First-Order Probabilistic Languages, PRL: a probabilistic relational language, Markov logic networks, Counting complexity of propositional abduction, Competing hypotheses and abductive inference, Consistency restoration and explanations in dynamic CSPs---Application to configuration, The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws, A general approach to reasoning with probabilities, Abductive Reasoning for Continual Dialogue Understanding, Probabilistic reasoning with answer sets, Probabilistic Inductive Logic Programming, New Advances in Logic-Based Probabilistic Modeling by PRISM, CLP( $\cal{BN}$ ): Constraint Logic Programming for Probabilistic Knowledge, Basic Principles of Learning Bayesian Logic Programs, The Independent Choice Logic and Beyond, Learning to Assign Degrees of Belief in Relational Domains, Compressing probabilistic Prolog programs, Learning to assign degrees of belief in relational domains, Learning probabilistic logic models from probabilistic examples, Structured machine learning: the next ten years, The role of relevance in explanation. II: Disjunctive assignments and approximate independence, Hybrid algorithms for approximate belief updating in Bayes nets, Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web, CP-logic: A language of causal probabilistic events and its relation to logic programming, Let's plan it deductively!, P-log: refinement and a new coherency condition, Abduction with probabilistic logic programming under the distribution semantics, Approximate well-founded semantics, query answering and generalized normal logic programs over lattices, The theory of interval probabilistic logic programs, Stochastic dynamic programming with factored representations, On the Efficient Execution of ProbLog Programs, A taxonomy of weight learning methods for statistical relational learning, Nonground Abductive Logic Programming with Probabilistic Integrity Constraints, Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks, Combining probabilistic logic programming with the power of maximum entropy

Cites Work