How to Restore Compactness into Probabilistic Logics?

DOI10.1007/978-3-540-87803-2_28zbMath1178.03034OpenAlexW1503614987MaRDI QIDQ3532477

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

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)

Related Items (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic logic
• Model theory.
• What does a conditional knowledge base entail?
• Some first-order probability logics
• A logic for reasoning about probabilities
• Strong non-standard completeness for fuzzy logics
• Some probability logics with new types of probability operators
• Some considerations on the logics P_FD A logic combining modality and probability
• Logics in Artificial Intelligence
• Logics in Artificial Intelligence
• Completeness theorem for a logic with imprecise and conditional probabilities
• Logics with the Qualitative Probability Operator
• Non-standard analysis
• Probability logic for type spaces

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