Pages that link to "Item:Q3612603"

The following pages link to Probabilistic reasoning with answer sets (Q3612603):

Displaying 37 items.

• Hybrid answer set programming (Q392277) (← links)
• Probabilistic (logic) programming concepts (Q894692) (← links)
• Robot location estimation in the situation calculus (Q901076) (← links)
• Causal inference in cplint (Q1679666) (← links)
• Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems (Q1711885) (← links)
• Syntax and semantics of multi-adjoint normal logic programming (Q1795198) (← links)
• Dealing with explicit preferences and uncertainty in answer set programming (Q1928820) (← links)
• Abduction with probabilistic logic programming under the distribution semantics (Q2076968) (← links)
• The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (Q2206456) (← links)
• Semiring programming: a semantic framework for generalized sum product problems (Q2206471) (← links)
• Complexity results for probabilistic answer set programming (Q2302961) (← links)
• P-log: refinement and a new coherency condition (Q2317975) (← links)
• Vicious circle principle, aggregates, and formation of sets in ASP based languages (Q2321320) (← links)
• Typicalities and probabilities of exceptions in nonmotonic description logics (Q2329599) (← links)
• Possibilistic nested logic programs and strong equivalence (Q2344722) (← links)
• Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions (Q2353984) (← links)
• Statistical statements in probabilistic logic programming (Q2694548) (← links)
• A Tool for Probabilistic Reasoning Based on Logic Programming and First-Order Theories Under Stable Model Semantics (Q2835884) (← links)
• Semantics for Possibilistic Disjunctive Programs (Q2845121) (← links)
• A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions (Q2900504) (← links)
• The PITA system: Tabling and answer subsumption for reasoning under uncertainty (Q3087434) (← links)
• Quantitative Semantics for Uncertain Knowledge Bases (Q3143399) (← links)
• Logic Programming with Graded Modality (Q3449234) (← links)
• Dialectical Proof Procedures for Probabilistic Abstract Argumentation (Q4571152) (← links)
• Stable reasoning (Q4586232) (← links)
• Computing <i>LP^MLN</i> using ASP and MLN solvers (Q4592718) (← links)
• Random logic programs: Linear model (Q4593016) (← links)
• An application of answer set programming to the field of second language acquisition (Q4601065) (← links)
• Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language + (Q4957223) (← links)
• Efficient Knowledge Compilation Beyond Weighted Model Counting (Q5038457) (← links)
• Learning Probabilistic Logic Programs over Continuous Data (Q5041772) (← links)
• (Q5078314) (← links)
• Bridging Commonsense Reasoning and Probabilistic Planning via a Probabilistic Action Language (Q5108524) (← links)
• (Q5856406) (← links)
• Lifted inference for statistical statements in probabilistic answer set programming (Q6064257) (← links)
• A landscape and implementation framework for probabilistic rough sets using \textsc{ProbLog} (Q6149551) (← links)
• Semiring reasoning frameworks in AI and their computational complexity (Q6488781) (← links)