Information algebras. Generic structures for inference
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Knowledge representation (68T30) Information theory (general) (94A15)
Information usually comes in pieces, from different sources. It refers to different, but related questions. Therefore information needs to be aggregated and focused onto the relevant questions. Considering combination and focusing of information as the relevant operations leads to a generic algebraic structure for information. This book introduces and studies information from this algebraic point of view. Algebras of information provide the necessary abstract framework for generic inference procedures. They allow the application of these procedures to a large variety of different formalisms for representing information. At the same time they permit a generic study of conditional independence, a property considered as fundamental for knowledge presentation. Information algebras provide a natural framework to define and study uncertain information. Uncertain information is represented by random variables that naturally form information algebras. This theory also relates to probabilistic assumption-based reasoning in information systems and is the basis for the belief functions in the Dempster-Shafer theory of evidence. The book addresses students and Computer science researchers interested in theoretical aspects of computer science and theory of information. Is has its root in the past European Basic Research activity DRUMSZ.
- Probabilistic argumentation systems. A new way to combine logic with probability.
- Probabilistic reasoning with graphical security models
- Ordered valuation algebras: A generic framework for approximating inference
- Compatibility, desirability, and the running intersection property
- Information algebras in the theory of imprecise probabilities
- Probability envelopes and their Dempster-Shafer approximations in statistical matching
- Information algebras in the theory of imprecise probabilities, an extension
- Algebras of sets and coherent sets of gambles
- An algebraic theory for data linkage
- An axiomatic framework for influence diagram computation with partially ordered preferences
- Thirty years of credal networks: specification, algorithms and complexity
- Correct audit logging in concurrent systems
- An algebraic theory for statistical information based on the theory of hints
- Sufficient and necessary conditions for solution finding in valuation-based systems
- Compositional models in valuation-based systems
- Updating credal networks is approximable in polynomial time
- Semiring induced valuation algebras: exact and approximate local computation algorithms
- Introduction: Combining probability and logic
- Probabilistic argumentation
- Uncertain information: random variables in graded semilattices
- A logic of soft constraints based on partially ordered preferences
- Belief functions on real numbers
- Causal compositional models in valuation-based systems with examples in specific theories
- On a condition for semirings to induce compact information algebras.
- On conditions for semirings to induce compact information algebras
- Generalized information theory based on the theory of hints
- Generic inference. A unifying theory for automated reasoning
- Marginalization in models generated by compositional expressions.
- Logical Compilation of Bayesian Networks with Discrete Variables
- Information: The Algorithmic Paradigm
- Uncertain Information
- Channels: From Logic to Probability
- One or Many Concepts of Information?
- Local Computation Schemes with Partially Ordered Preferences
- Information and \(\sigma\)-algebras
- scientific article; zbMATH DE number 3731917 (Why is no real title available?)
- Generic local computation
- Model-based reliability and diagnostics: A common framework for reliability and diagnostics
- Two Cartesian closed categories of information algebras
- On conditions for mappings to preserve optimal solutions of semiring-induced valuation algebras
- Non-locality, contextuality and valuation algebras: a general theory of disagreement
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- A belief function classifier based on information provided by noisy and dependent features
- Information Algebra
- Enabling local computation for partially ordered preferences
- Nonlinear desirability theory
- Contextuality in distributed systems
- Convergence of datalog over (pre-) semirings
- The marginal problem for sets of desirable gambles sets with a finite representation
- Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
- Fast local search methods for solving limited memory influence diagrams
- Understanding epistemic relevance
This page was built for publication: Information algebras. Generic structures for inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4408097)