Super-Solutions

DOI10.1145/2627354MaRDI QIDQ2946725zbMATH OpenOpenAlexWikidataFDO

Authors Cristian Molinaro, Amy Sliva, V. S. Subrahmanian

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2627354

zbMATH Keywords

imprecise probabilitiestemporal reasoningprobabilistic reasoningabductive reasoning

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27) Temporal logic (03B44)

Recommendations

• Abduction in annotated probabilistic temporal logic
• Annotated probabilistic temporal logic
• Annotated probabilistic temporal logic: approximate fixpoint implementation
• A superposition calculus for abductive reasoning
• HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties
• Temporalization of Probabilistic Propositional Logic
• Probabilistic propositional temporal logics
• scientific article; zbMATH DE number 1536570

Cites work

• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 47350 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 4189212 (Why is no real title available?)
• A logic for reasoning about probabilities
• Abduction in annotated probabilistic temporal logic
• Abductive Logic Programming
• Abductive inference in probabilistic logic programs
• Abductive logic programs with penalization: semantics, complexity and implementation
• Abductive reasoning through filtering
• An abductive event calculus planner
• Annotated probabilistic temporal logic
• Annotated probabilistic temporal logic: approximate fixpoint implementation
• Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules
• Logics in Artificial Intelligence
• Parallel abductive query answering in probabilistic logic programs
• Probabilistic Horn abduction and Bayesian networks
• Probabilistic logic
• Probabilistic logic programming
• Probability logic
• Semantics and complexity of abduction from default theories
• The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments
• The complexity of facets (and some facets of complexity)
• The complexity of logic-based abduction
• The computational complexity of abduction
• The independent choice logic for modelling multiple agents under uncertainty

Cited in

(3)

• Abduction in annotated probabilistic temporal logic
• Explanations for query answers under existential rules
• Annotated probabilistic temporal logic: approximate fixpoint implementation

This page was built for publication: Super-Solutions

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