How to Restore Compactness into Probabilistic Logics?

Authors:
Aleksandar Perović;Zoran Ognjanović;Miodrag Rašković;Zoran Marković
Affiliations:
Saobraćajni fakultet, Beograd 11000;Matematički institut SANU, Beograd 11000;Matematički institut SANU, Beograd 11000;Matematički institut SANU, Beograd 11000
Venue:
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Year:
2008

Citing 5
Cited 1

Probabilistic logic

Artificial Intelligence
A logic for reasoning about probabilities

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
What does a conditional knowledge base entail?

Artificial Intelligence
Some first-order probability logics

Theoretical Computer Science
Strong non-standard completeness for fuzzy logics

Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special issue (pp 315-357) "Ordered structures in many-valued logic"

Finitely additive probability measures on classical propositional formulas definable by Gödel's t-norm and product t-norm

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper offers a proof of the compactness theorem for the $^*\mathbb R$-valued polynomial weight formulas. We also provide a complete axiomatization for the polynomial weight formulas.