On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability

DOI10.1007/978-3-540-87993-0_28zbMATH Open1245.68220OpenAlexW1571300093MaRDI QIDQ3534675FDOQ3534675

Authors: Emad W. Saad 

Publication date: 4 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87993-0_28

Recommendations

• Probabilistic Reasoning by SAT Solvers
• Resolution for stochastic Boolean satisfiability
• A semantics for hybrid probabilistic logic programs with function symbols
• Stochastic Boolean satisfiability
• A hybrid method for probabilistic satisfiability

Mathematics Subject Classification ID

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

Cites Work

• ASSAT: computing answer sets of a logic program by SAT solvers
• Title not available (Why is that?)
• Logic programs with stable model semantics as a constraint programming paradigm
• A machine program for theorem-proving
• The independent choice logic for modelling multiple agents under uncertainty
• Probabilistic logic programming
• Logic Programming
• Stochastic Boolean satisfiability
• Contingent planning under uncertainty via stochastic satisfiability
• Combining probabilistic logic programming with the power of maximum entropy
• Title not available (Why is that?)
• A new approach to hybrid probabilistic logic programs
• Games against nature
• A semantical framework for supporting subjective and conditional probabilities in deductive databases
• Stable semantics for probabilistic deductive databases
• Hybrid probabilistic programs
• Logic Programming and Nonmonotonic Reasoning
• A Logical Approach to Qualitative and Quantitative Reasoning
• Incomplete Knowledge in Hybrid Probabilistic Logic Programs

Cited In (4)

• Hybrid probabilistic logic programs as residuated logic programs
• Bridging the gap between reinforcement learning and knowledge representation: a logical off- and on-policy framework
• Probabilistic Reasoning by SAT Solvers
• Logic Programming

This page was built for publication: On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability

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