×

zbMATH — the first resource for mathematics

How to restore compactness into probabilistic logics? (English) Zbl 1178.03034
Hölldobler, Steffen (ed.) et al., Logics in artificial intelligence. 11th European conference, JELIA 2008, Dresden, Germany, September 28–October 1, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87802-5/pbk). Lecture Notes in Computer Science 5293. Lecture Notes in Artificial Intelligence, 338-348 (2008).
Summary: 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.
For the entire collection see [Zbl 1146.68009].

MSC:
03B48 Probability and inductive logic
PDF BibTeX XML Cite
Full Text: DOI