Pages that link to "Item:Q2302961"

The following pages link to Complexity results for probabilistic answer set programming (Q2302961):

Displaying 12 items.

• The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (Q2206456) (← links)
• Special issue on probabilistic logic programming (PLP 2018) (Q2237158) (← links)
• The complexity of inferences and explanations in probabilistic logic programming (Q2401894) (← links)
• Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds (Q2426104) (← links)
• On the computational aspects of the maximal specificity in probabilistic explanation (Q2895851) (← links)
• Anytime Computation of Cautious Consequences in Answer Set Programming (Q2931278) (← links)
• Parallel Abductive Query Answering in Probabilistic Logic Programs (Q2946697) (← links)
• Probabilistic logic programming with conditional constraints (Q3549126) (← links)
• Probabilistic reasoning with answer sets (Q3612603) (← links)
• Complexity Results for Probabilistic Datalog (Q4576254) (← links)
• On the Complexity of Answer Set Programming with Aggregates (Q5425401) (← links)
• Lifted inference for statistical statements in probabilistic answer set programming (Q6064257) (← links)