A new approach to hybrid probabilistic logic programs

DOI10.1007/S10472-007-9048-3MaRDI QIDQ2642628zbMATH OpenOpenAlexFDO

Authors Emad W. Saad, Enrico Pontelli

Publication date 17 August 2007

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-007-9048-3

zbMATH Keywords

Logic programmingNegation as failureProbabilistic reasoning

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Logic Programming
• A semantics for hybrid probabilistic logic programs with function symbols
• Incomplete Knowledge in Hybrid Probabilistic Logic Programs
• scientific article; zbMATH DE number 1759369
• Hybrid probabilistic logic programs as residuated logic programs

Cites work

• A semantical framework for supporting subjective and conditional probabilities in deductive databases
• An abstract machine for efficiently computing queries to well-founded models
• Bilattices and the semantics of logic programming
• Epistemic entrenchment and possibilistic logic
• scientific article; zbMATH DE number 4057054 (Why is no real title available?)
• scientific article; zbMATH DE number 4064538 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 3598539 (Why is no real title available?)
• scientific article; zbMATH DE number 1942457 (Why is no real title available?)
• scientific article; zbMATH DE number 1753155 (Why is no real title available?)
• scientific article; zbMATH DE number 1759369 (Why is no real title available?)
• scientific article; zbMATH DE number 1875392 (Why is no real title available?)
• scientific article; zbMATH DE number 1453068 (Why is no real title available?)
• Hybrid probabilistic programs
• Incomplete Knowledge in Hybrid Probabilistic Logic Programs
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Logic Programming
• Logic programming and negation: A survey
• Logic Programming and Nonmonotonic Reasoning
• Mathematical Foundations of Computer Science 2003
• Probabilistic logic programming
• Quantitative deduction and its fixpoint theory
• Stable semantics for probabilistic deductive databases
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• The alternating fixpoint of logic programs with negation
• The well-founded semantics for general logic programs
• Uncertain deductive databases: a hybrid approach

Cited in

(14)

• Hybrid probabilistic logic programs as residuated logic programs
• A semantics for hybrid probabilistic logic programs with function symbols
• Improving the efficiency of Gibbs sampling for probabilistic logical models by means of program specialization
• On the implementation of the probabilistic logic programming language ProbLog
• Bridging the gap between reinforcement learning and knowledge representation: a logical off- and on-policy framework
• A Logical Approach to Qualitative and Quantitative Reasoning
• Incomplete Knowledge in Hybrid Probabilistic Logic Programs
• On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
• Probabilistic Reasoning by SAT Solvers
• Hybrid answer set programming
• scientific article; zbMATH DE number 1759369 (Why is no real title available?)
• Logic Programming
• Inductive Logic Programming
• Syntactic requirements for well-defined hybrid probabilistic logic programs

Describes a project that uses

Uses Software

• PRISM

This page was built for publication: A new approach to hybrid probabilistic logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642628)