Propositional information systems

Journal of Logic and Computation

Volumn 9, Issue 5, 1999, Pages 651-681

  Kohlas, Jürg ^a   Haenni, Rolf ^a   Moral, Serafìn ^b  

^a UNIVERSITY OF FRIBOURG   (Switzerland)

^b UNIVERSITY OF GRANADA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; DISTRIBUTED COMPUTER SYSTEMS; KNOWLEDGE REPRESENTATION;

INFORMATION COMBINATION; INFORMATION MARGINALIZATION; INFORMATION SYSTEMS; PROPOSITIONAL LOGIC; VALUATION NETWORKS;

FORMAL LOGIC;

EID: 0033311079     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/9.5.651     Document Type: Article

References (35)

1. R. Almond and A. Kong. Optimality issues in constructing a markov tree from graphical models. Research Report A3, Department of Statistics, Harvard University, November 1991.
2. B. Anrig, R. Haenni, J. Kohlas and N. Lehmann. Assumptionbased modeling using ABEL. In Symbolic and Quantitative Approaches to Uncertainty, European Conference ECSQARU'97', Bonn, 1997.
3. B. Anrig, R. Haenni and N. Lehmann. ABEL a new language for assumptionbased evidential reasoning under uncertainty. Technical Report 9701, University of Fribourg, Institute of Informatics, 1997.
4. S. Arnborg, D. Corneil and A. Proskurowski. Complexity of finding embedings in a ktree. SIAM Journal of Algebraic and Discrete Methods, 38, 277-284, 1987.
5. U. Bertele and F. Brioschi. Nonserial Dynamic Programming. Academic Press, 1972.
6. G. Birkhoff and T.C. Bartee. Modern Applied Algebra. McGraw Hill, New York, 1970.
7. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 5, 394-397, 1962.
8. M. Davis and H. Putnam. A computing procedure for quantification theory. In Automation of Reasoning I: Classical Papers on Computational Logic 1957/1966, J. Siekmann and G. Wrightson, eds. pp. 125-139. Springer, Berlin, Heidelberg, 1983.
9. J. de Kleer. An assumptionbased TMS. Artificial Intelligence, 28, 127-162, 1986.
10. R. Dechter and A. Dechter. Structuredriven algorithms for truth maintenance. Artificial Intelligence, 82, 120, 1996.
11. R. Dechter and I. Rish. Directional resolution: The Davis-Putnam procedure revisited. In Principles of Knowledge Representation and Reasoning, pp. 134-145, 1994.
12. D. Dubois and H. Prade. A survey of belief revision and updating rules in various uncertainty models. International Journal of General Systems, 9, 61-100, 1994.
13. J. N. Hooker. Logical inference and polyhedral projection. In Computer Science Logic, volume 626 of Lecture Notes in Computer Science, E. Börger, G. Jäger, H. Kleine-Büning and M. M. Richter, eds. pp. 184-200. Springer Verlag, Berlin, Heidelberg, New York, 1992.
14. K. Inoue. Linear resolution for consequence finding. Artificial Intelligence, 56, 301-353, 1992.
15. U. Kjœrulff. Triangulation of graphsalgorithms giving small total space. Technical Report R9009, Department of Mathematics and Computer Science, Aalborg University, Denmark, 1990.
16. J. Kohlas. Symbolic evidence, arguments, supports and valuation networks. In Symbolic and Quantitative Aproaches to Reasoning and Uncertainty, M. Kruse M. Clarke and S. Moral, eds. pp. 186-198. Springer, 1993.
17. J. Kohlas. Mathematical foundations of evidence theory. In Mathematical Models for Handling Partial Knowledge in Artificial Intelligence, G. Coletti, D. Dubois, and R. Scozzafava, eds. pp. 31-64. Plenum Press, 1995.
18. J. Kohlas and P. A. Monney. Probabilistic assumption-based reasoning. In Proceedings of the 9th Conference on Uncertainty in Artificial Intellitence Heckermann and Mamdani, eds. Morgan Kaufmann, 1993.
19. J. Kohlas and P. A. Monney. A Mathematical Theory of Hints. An Approach to the DempsterShafer Theory of Evidence, volume 425 of Lecture Notes in Economics and Mathematical Systems. Springer, 1995.
20. J. Kohlas and R. F. Stärk. Information algebras and information systems. Technical Report 9614, University of Fribourg, Institute of Informatics, 1996.
21. A. Kong. Multivariate Belief Functions and Graphical Models. PhD thesis, Department of Statistics, Harvard University, 1986.
22. K. Lange and M. Boehnke. Extensions to pedigree analysis: Optimal calculations of mendelian likelihoods. Human Heredity, 33, 291-301, 1983.
23. K. B. Laskey and P. E. Lehner. Assumptions, beliefs and probabilities. Artificial Intelligence, 41, 65-77, 1989.
24. S. L. Lauritzen and D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. Journal of Royal Statistical Society, 50, 157-224, 1988.
25. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988.
26. G. M. Provan. A logic based analysis of Dempster-Shafer theory. International Journal of Approximate Reasoning, 4, 451-495, 1990.
27. R. Reiter and J. de Kleer. Foundations of assumption based truth maintenance systems. Proceedings of the American Association in AI, pp. 183-188, 1987.
28. D. J. Rose. Triangulated graphs and the elimination process. Journal of Mathematical Analysis and Applications, 32, 597-609, 1970.
29. P. P. Shenoy and G. Shafer. Axioms for probability and belief function propagation. In Uncertainty in Artificial Intelligence 4, R. D. Shachter et al., eds. pp. 169-198. North Holland, 1990.
30. R. Sikorski. Boolean Algebras. Springer, Berlin, 1960.
31. R. E. Tarjan and M. Yannakakis. Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal of Computing, 13, 566-579, 1984.
32. A. Thomas. Optimal computation of probability functions for Pedigree Analysis. J. Math. Appl. Med. and Bio., 3, 167-178, 1986.
33. W. X. Wen. Optimal decomposition of belief networks. In Uncertainty in Artificial Intelligence. P. Bonissone, ed. North Holland, 1991.
34. H. P. Williams. FourierMotzkin elimination exension to integer programming problems. Journal of Combinatorial Theory, 21, 118-123, 1976.
35. M. Yannakakis. Computing the minimum fillin is NPcomplete. SIAM Journal of Algebraic and Discrete Methods, 2, 77-79, 1981.