How to Restore Compactness into Probabilistic Logics?

DOI10.1007/978-3-540-87803-2_28MaRDI QIDQ3532477zbMATH OpenOpenAlexFDO

Authors Miodrag Rašković, Zoran Marković, Aleksandar Perović, Zoran Ognjanović

Publication date 27 October 2008

Published in Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87803-2_28

Mathematics Subject Classification ID

Probability and inductive logic (03B48)

Cites work

• A logic for reasoning about probabilities
• Completeness theorem for a logic with imprecise and conditional probabilities
• scientific article; zbMATH DE number 4069225 (Why is no real title available?)
• scientific article; zbMATH DE number 591047 (Why is no real title available?)
• scientific article; zbMATH DE number 1122846 (Why is no real title available?)
• scientific article; zbMATH DE number 1873277 (Why is no real title available?)
• Logics in Artificial Intelligence
• Logics in Artificial Intelligence
• Logics with the Qualitative Probability Operator
• Model theory.
• Non-standard analysis
• Probabilistic logic
• Probability logic for type spaces
• Some considerations on the logics P_FD A logic combining modality and probability
• Some first-order probability logics
• Some probability logics with new types of probability operators
• Strong non-standard completeness for fuzzy logics
• What does a conditional knowledge base entail?

Cited in

(5)

• Logics with Probability Operators
• Some New Probability Operators
• Applications of Logics About Simple Probabilities
• Finitely additive probability measures on classical propositional formulas definable by Gödel's t-norm and product t-norm
• Probability logics for reasoning about quantum observations

This page was built for publication: How to Restore Compactness into Probabilistic Logics?

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