Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
From MaRDI portal
Recommendations
- Approximate Inference for Logic Programs with Annotated Disjunctions
- Logic Programming
- Determining inference semantics for disjunctive logic programs
- Generalized disjunctive well-founded semantics for logic programs.
- Inductive Logic Programming
- scientific article; zbMATH DE number 2089453
- scientific article; zbMATH DE number 846973
- scientific article; zbMATH DE number 1884387
- Comparisons and computation of well-founded semantics for disjunctive logic programs
- scientific article; zbMATH DE number 1453067
Cites work
- Abducing through negation as failure: stable models within the independent choice logic
- Efficient top-down computation of queries under the well-founded semantics
- Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
- Logic Programming
- The independent choice logic for modelling multiple agents under uncertainty
Cited in
(11)- Approximate Inference for Logic Programs with Annotated Disjunctions
- Logic Programming
- Applying the information bottleneck to statistical relational learning
- Towards Learning Non-recursive LPADs by Transforming Them into Bayesian Networks
- Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
- ALLPAD: approximate learning of logic programs with annotated disjunctions
- Logic-based decision support for strategic environmental assessment
- SLGAD resolution for inference on logic programs with annotated disjunctions
- Structure learning of probabilistic logic programs by searching the clause space
- The PITA system: tabling and answer subsumption for reasoning under uncertainty
- Inductive Logic Programming
This page was built for publication: Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504688)