Abstract
In the context of polyadic inductive logic we give a general representation theorem applicable to all probability functions satisfying Spectrum Exchangeability as the weighted difference of two probability functions satisfying Spectrum Exchangeability and Language Invariance. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
APA
Paris, J. B., & Vencovská, A. (2009). A general representation theorem for probability functions satisfying spectrum exchangeability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5635 LNCS, pp. 379–388). https://doi.org/10.1007/978-3-642-03073-4_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free