Skip to main content
SpringerLink
Log in
Book cover

European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty

ECSQARU 1999: Symbolic and Quantitative Approaches to Reasoning and Uncertainty pp 386–396Cite as

Logical Deduction using the Local Computation Framework

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1638))

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).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Article  MATH  Google Scholar 

  4. M. L. Ginsberg. A Circumscriptive Theorem Prover. Artificial Intelligence, 39:209–230, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  5. K. Inoue. Linear resolution for consequence finding. Artificial Intelligence, 56:301–353, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  6. 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.

    Google Scholar 

  7. J. Kohlas and S. Moral. Propositional information systems. Unpublished report, May 1996.

    Google Scholar 

  8. J. Kohlas, S. Moral, and R. Haenni. Propositional Information Systems. Journal of Logic and Computation, 1999.

    Google Scholar 

  9. 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.

    MATH  MathSciNet  Google Scholar 

  10. 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.

    Google Scholar 

  11. J. M. McCarthy. Applications of Circumscription to Formalizing Common-Sense Knowledge. Artificial Intelligence, 28:89–116, 1986.

    Article  MathSciNet  Google Scholar 

  12. 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.

    Google Scholar 

  13. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.

    Google Scholar 

  14. T. Przymusiñski. An algorithm to compute circumscription. Artificial Intelligence, 38(1):49–73, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  15. 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.

    Google Scholar 

  16. G. Shafer and P. P. Shenoy. Probability Propagation. Annals of Mathematics and Artificial Intelligence, 2:327–352, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  17. P. P. Shenoy. Consistency in Valuation-Based Systems. ORSA Journal on Computing, 6(3):281–291, 1994.

    MATH  MathSciNet  Google Scholar 

  18. 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.

    Google Scholar 

  19. P. Siegel. Représentation et Utilisation de la Connaissance En Calcul Propositionnel. Thèse d’é at, Université d’Aix-Marseille II, Luminy, 1987.

    Google Scholar 

  20. 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.

    Google Scholar 

  21. N. Wilson. Extended Probability. In W. Wahlster, editor, Proceedings of the 12th European Conference on Artificial Intelligence, pages 667–771. John Wiley & Sons, 1996.

    Google Scholar 

  22. 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.

    Google Scholar 

  23. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Oxford Brookes University, School of Computing and Mathematical Sciences, Gipsy Lane, OX3 0BP, Headington Oxford, UK

    Nic Wilson

  2. Université Paul Sabatier, Institut de Recherche en Informatique de Toulouse, 118 route de Narbonne, F-31082, Toulouse Cedex

    Jérôme Mengin

Authors
  1. Nic Wilson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jérôme Mengin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University College London, Gower Street, WC1E 6BT, London, UK

    Anthony Hunter

  2. Department of Electronic Engineering, University of London, Queen Mary and Westfield College, E1 4NS, London, UK

    Simon Parsons

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation