Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
From MaRDI portal
Publication:5504688
DOI10.1007/978-3-540-89982-2_54zbMath1185.68178OpenAlexW2143234675WikidataQ58063901 ScholiaQ58063901MaRDI QIDQ5504688
Publication date: 22 January 2009
Published in: Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89982-2_54
well-founded semanticsprobabilistic logic programminglogic programs with annotated disjunctionsSLG resolution
Related Items (5)
Structure learning of probabilistic logic programs by searching the clause space ⋮ Applying the information bottleneck to statistical relational learning ⋮ Logic–based decision support for strategic environmental assessment ⋮ The PITA system: Tabling and answer subsumption for reasoning under uncertainty ⋮ Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
Cites Work
- The independent choice logic for modelling multiple agents under uncertainty
- Efficient top-down computation of queries under the well-founded semantics
- Abducing through negation as failure: stable models within the independent choice logic
- Logic Programming
- Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
This page was built for publication: Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
