Logical deduction using the local computation framework

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1638, Issue , 1999, Pages 386-396

  Wilson, Nic ^a   Mengin, Jérôme ^b  

^a OXFORD BROOKES UNIVERSITY   (United Kingdom)

^b IRIT   (France)

Author keywords

Circumscription; Deduction; First order logic; Theorem proving

Indexed keywords

EID: 84947923930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48747-6_36     Document Type: Conference Paper

References (23)

1. P. Doherty, W. Lukasewicz, and A. Szalas. Computing Circumscription Revisited: A Reduction Algorithm. In C. S. Mellish, editor, Proceedings of the lfth International Joint Conference on Artificial Intelligence, pages 1502-1508. I.J.C.A.I., Morgan Kaufmann, 1995.
2. D. Gabbay and H. J. Ohlbach. Quantifier Elimination in Second-Order Predicate Logic. Report MPI-I-92-231, Max-Planck Institut für Informatik, Saarbrücken, Germany, 1992.
3. M. Gelfond, H. Przymusinska, 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.
4. M. L. Ginsberg. A Circumscriptive Theorem Prover. Artificial Intelligence, 39:209-230, 1989.
5. K. Inoue. Linear resolution for consequence finding. Artificial Intelligence, 56:301-353, 1992.
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.
7. J. Kohlas and S. Moral. Propositional information systems. Unpublished report, May 1996.
8. J. Kohlas, S. Moral, and R. Haenni. Propositional Information Systems. Journal of Logic and Computation, 1999.
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.
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.
11. J. M. McCarthy. Applications of Circumscription to Formalizing Common-Sense Knowledge. Artificial Intelligence, 28:89-116, 1986.
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.L, MIT Press.
13. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
14. T. Przymusiñski. An algorithm to compute circumscription. Artificial Intelligence, 38(1):49-73, 1989.
15. A. Safhotti 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.
16. G. Shafer and P. P. Shenoy. Probability Propagation. Annals of Mathematics and Artificial Intelligence, 2:327-352, 1990.
17. P. P. Shenoy. Consistency in Valuation-Based Systems. ORSA Journal on Computing, 6(3):281-291, 1994.
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.
19. P. Siegel. Représentation et Utilisation de la Connaissance En Calcul Propositionnel. Thèse d’état, Université d’Aix-Marseille II, Luminy, 1987.
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.
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.
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 № 97-50, pages 135-139. Johannes Kepler Universität, Linz (Austria), 1997.
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.