{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T22:10:06Z","timestamp":1739052606788,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642006586"},{"type":"electronic","value":"9783642006593"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00659-3_5","type":"book-chapter","created":{"date-parts":[[2009,4,7]],"date-time":"2009-04-07T01:57:56Z","timestamp":1239069476000},"page":"95-127","source":"Crossref","is-referenced-by-count":1,"title":["Information Algebra"],"prefix":"10.1007","author":[{"given":"J\u00fcrg","family":"Kohlas","sequence":"first","affiliation":[]},{"given":"Cesar","family":"Schneuwly","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511895968","volume-title":"Information Flow: The Logic of Distributed Systems","author":"J. Barwise","year":"1997","unstructured":"Barwise, J., Seligman, J.: Information Flow: The Logic of Distributed Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a044. Cambridge University Press, Cambridge (1997)"},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. Journal of the ACM\u00a030(3), 479\u2013513 (1983)","journal-title":"Journal of the ACM"},{"key":"5_CR3","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"1990","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)"},{"key":"5_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-7633-9","volume-title":"General Lattice Theory","author":"G. Gr\u00e4tzer","year":"1978","unstructured":"Gr\u00e4tzer, G.: General Lattice Theory. Academic Press, London (1978)"},{"key":"5_CR5","series-title":"Algorithms for Uncertainty and Defeasible Reasoning","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-94-017-1737-3_6","volume-title":"Handbook of Defeasible Reasoning and Uncertainty Management Systems","author":"R. Haenni","year":"2000","unstructured":"Haenni, R., Kohlas, J., Lehmann, N.: Probabilistic argumentation systems. In: Kohlas, J., Moral, S. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems. Algorithms for Uncertainty and Defeasible Reasoning, vol.\u00a05, pp. 221\u2013287. Kluwer, Dordrecht (2000)"},{"key":"5_CR6","volume-title":"Algebraic Logic","author":"P.R. Halmos","year":"1962","unstructured":"Halmos, P.R.: Algebraic Logic. Chelsea, New York (1962)"},{"doi-asserted-by":"crossref","unstructured":"Paul, R.: Halmos and Steven Givant. Logic as Algebra. Dolciani Mathematical Expositions No. 21, Mathematical Association of America (1998)","key":"5_CR7","DOI":"10.1090\/dol\/021"},{"key":"5_CR8","volume-title":"Cylindric Algebras","author":"L. Henkin","year":"1971","unstructured":"Henkin, L., Monk, J.D., Tarski, A.: Cylindric Algebras. North-Holland, Amsterdam (1971)"},{"key":"5_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0009-6","volume-title":"Information Algebras: Generic Structures for Inference","author":"J. Kohlas","year":"2003","unstructured":"Kohlas, J.: Information Algebras: Generic Structures for Inference. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Kohlas, J.: Uncertain information: random variables in graded semilattices. Int. J. Approx. Reason. (2007) doi:10.1016\/j.ijar.2006.12.005","key":"5_CR10","DOI":"10.1016\/j.ijar.2006.12.005"},{"issue":"5","key":"5_CR11","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1093\/logcom\/9.5.651","volume":"9","author":"J. Kohlas","year":"1999","unstructured":"Kohlas, J., Haenni, R., Moral, S.: Propositional information systems. Journal of Logic and Computation\u00a09(5), 651\u2013681 (1999)","journal-title":"Journal of Logic and Computation"},{"key":"5_CR12","series-title":"Algorithms for Uncertainty and Defeasible Reasoning","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-94-017-1737-3_2","volume-title":"Handbook of Defeasible Reasoning and Uncertainty Management Systems","author":"J. Kohlas","year":"2000","unstructured":"Kohlas, J., Shenoy, P.P.: Computation in valuation algebras. In: Kohlas, J., Moral, S. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems. Algorithms for Uncertainty and Defeasible Reasoning, vol.\u00a05, pp. 5\u201339. Kluwer, Dordrecht (2000)"},{"unstructured":"Kohlas, J., Wilson, N.: Exact and approximate local computation in semiring induced valuation algebras. Technical Report 06-06, Department of Informatics, University of Fribourg (2006)","key":"5_CR13"},{"issue":"2","key":"5_CR14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"S.L. Lauritzen","year":"1988","unstructured":"Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. J. of Royal Stat. Soc.\u00a050(2), 157\u2013224 (1988)","journal-title":"J. of Royal Stat. Soc."},{"key":"5_CR15","volume-title":"The Theory of Relational Databases","author":"D. Maier","year":"1983","unstructured":"Maier, D.: The Theory of Relational Databases. Pitman, London (1983)"},{"key":"5_CR16","volume-title":"Theory of Random Sets","author":"I. Molchanov","year":"2005","unstructured":"Molchanov, I.: Theory of Random Sets. Springer, London (2005)"},{"key":"5_CR17","series-title":"Mathematics and its applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-0820-1","volume-title":"Universal Algebra, Algebraic Logic, and Databases","author":"B.I. Plotkin","year":"1994","unstructured":"Plotkin, B.I.: Universal Algebra, Algebraic Logic, and Databases. Mathematics and its applications, vol.\u00a0272. Kluwer Academic Publishers, Dordrecht (1994)"},{"unstructured":"Pouly, M.: Nenok 1.1 user guide. Technical Report 06-02, Department of Informatics, University of Fribourg (2006)","key":"5_CR18"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communications. The Bell System Technical Journal\u00a027, 379\u2013432 (1948)","journal-title":"The Bell System Technical Journal"},{"key":"5_CR20","series-title":"Machine intelligence and pattern recognition","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/B978-0-444-88650-7.50019-6","volume-title":"Uncertainty in Artificial Intelligence 4","author":"P.P. Shenoy","year":"1990","unstructured":"Shenoy, P.P., Shafer, G.: Axioms for probability and belief-function proagation. In: Shachter, R.D., Levitt, T.S., Kanal, L.N., Lemmer, J.F. (eds.) Uncertainty in Artificial Intelligence 4. Machine intelligence and pattern recognition, vol.\u00a09, pp. 169\u2013198. Elsevier, Amsterdam (1990)"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/B978-0-444-88650-7.50019-6","volume-title":"Uncertainty in Artif. Intell.\u00a04","author":"P.P. Shenoy","year":"1990","unstructured":"Shenoy, P.P., Shafer, G.: Axioms for probability and belief function propagation. In: Lemmer, J.F., Shachter, R.D., Levitt, T.S., Kanal, L.N. (eds.) Uncertainty in Artif. Intell.\u00a04, pp. 169\u2013198. North-Holland, Amsterdam (1990)"},{"key":"5_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139166386","volume-title":"Mathematical Theory of Domains","author":"V. Stoltenberg-Hansen","year":"1994","unstructured":"Stoltenberg-Hansen, V., Lindstroem, I., Griftor, E.: Mathematical Theory of Domains. Cambridge University Press, Cambridge (1994)"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/3-540-48747-6_36","volume-title":"Symbolic and Quantitative Approaches to Reasoning and Uncertainty","author":"N. Wilson","year":"1999","unstructured":"Wilson, N., Mengin, J.: Logical deduction using the local computation framework. In: Hunter, A., Parsons, S. (eds.) ECSQARU 1999. LNCS, vol.\u00a01638, pp. 386\u2013396. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Formal Theories of Information"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00659-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T21:43:52Z","timestamp":1739051032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00659-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642006586","9783642006593"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00659-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}