Abstract
Computation in a number of uncertainty formalisms has recently been revolutionized by the notion of local computation. [13] and [9] showed how Bayesian probability could be efficiently propagated in a network of variables; this has already lead to sizeable successful applications, as well as a large body of literature on these Bayesian networks and related issues (e.g., the majority of papers in the Uncertainty in Artificial Intelligence conferences over the last ten years).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. Doherty, W. Lukasewicz, and A. Szalas. Computing Circumscription Revisited: A Reduction Algorithm. In C. S. Mellish, editor, Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 1502–1508.I.J.C.A.I., Morgan Kaufmann, 1995.
D. Gabbay and H. J. Ohlbach. Quantifier Elimination in Second-Order Predicate Logic. ReportMPI-I-92-231, Max-Planck Institut für Informatik, Saarbrücken, Germany, 1992.
M. Gelfond, H. Przymusiñska, and T. Przymusiñski. On the Relationship Between CWA, Minimal Model, and Minimal Herbrand Model Semantics. International Journal of Intelligent Systems, 5:549–564, 1990.
M. L. Ginsberg. A Circumscriptive Theorem Prover. Artificial Intelligence, 39:209–230, 1989.
K. Inoue. Linear resolution for consequence finding. Artificial Intelligence, 56:301–353, 1992.
K. Inoue and N. Helft. On Theorem Provers for Circumscription. In P. F. Patel-Schneider, editor, Proceedings of the Eighth Biennial Conference of the Canadian Society for Computational Studies of Intelligence, pages 212–219, 1990.
J. Kohlas and S. Moral. Propositional information systems. Unpublished report, May 1996.
J. Kohlas, S. Moral, and R. Haenni. Propositional Information Systems. Journal of Logic and Computation, 1999.
S. L. Lauritzen and D. Spiegelhalter. Local computations with probabilities on graphical structures and their application to Expert Systems. Journal of the Royal Statistical Society ser. B, 50(2):157–224, 1988.
V. Lifschitz. Computing Circumscription. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 121–127. I.J.C.A.I., Morgan Kaufmann, 1985.
J. M. McCarthy. Applications of Circumscription to Formalizing Common-Sense Knowledge. Artificial Intelligence, 28:89–116, 1986.
S. Moral and N. Wilson. Markov Chain Monte-Carlo algorithms for the calculation of Dempster-Shafer belief. In Proceedings of the Twelfth National Conference on Artificial Intelligence, pages 269–274, Cambridge, Mass, 1994. A.A.A.I.,MIT Press.
J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
T. Przymusiñski. An algorithm to compute circumscription. Artificial Intelligence, 38(1):49–73, 1989.
A. Saffotti and E. Umkehrer. PULCINELLA: A General Tool for Propagating Uncertainty in Valuation Networks. In B. D. D’ Ambrosio, P. Smets, and P. P. Bonissone, editors, Uncertainty in Artificial Intelligence: Proceedings of the 7th Conference, pages 323–331. Morgan Kaufmann, 1991.
G. Shafer and P. P. Shenoy. Probability Propagation. Annals of Mathematics and Artificial Intelligence, 2:327–352, 1990.
P. P. Shenoy. Consistency in Valuation-Based Systems. ORSA Journal on Computing, 6(3):281–291, 1994.
P. P. Shenoy and G. Shafer. Axioms for probability and belief-function propagation. In G. Shafer and J. Pearl, editors, Readings in Uncertain Reasoning, pages 575–610. Morgan Kaufmann, 1990.
P. Siegel. Représentation et Utilisation de la Connaissance En Calcul Propositionnel. Thèse d’é at, Université d’Aix-Marseille II, Luminy, 1987.
A. Szalas. On Correspondence Between Modal and Classical Logic: Automated Approach. Technical Report MPI-I-92-209, Max-Planck-Institut für Informatik, Saarbrücken, 1992.
N. Wilson. Extended Probability. In W. Wahlster, editor, Proceedings of the 12th European Conference on Artificial Intelligence, pages 667–771. John Wiley & Sons, 1996.
N. Wilson and J. Mengin. Logical Deduction using the Local Computation Framework. In M. P. Bonacina and U. Furbach, editors, International Workshop on First-Order Theorem Proving (FTP’97), RISC-Linz Report Series No. 97-50, pages 135–139. Johannes Kepler Universität, Linz (Austria), 1997.
N. Wilson and S. Moral. A logical view of probability. In T. Cohn, editor, Proceedings of the 11th European Conference on Artificial Intelligence, pages 386–390. John Wiley & Sons, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wilson, N., Mengin, J. (1999). Logical Deduction using the Local Computation Framework. In: Hunter, A., Parsons, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1999. Lecture Notes in Computer Science(), vol 1638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48747-6_36
Download citation
DOI: https://doi.org/10.1007/3-540-48747-6_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66131-3
Online ISBN: 978-3-540-48747-0
eBook Packages: Springer Book Archive