Embedding logics in the local computation framework

Journal of Applied Non-Classical Logics

Volumn 11, Issue 3-4, 2001, Pages 239-267

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

^a OXFORD BROOKES UNIVERSITY   (United Kingdom)

^b IRIT   (France)

Author keywords

Circumscription; Deduction; Local Computation; Modal and Conditional Logics; Possibilistic Logic; Theorem Proving

Indexed keywords

EID: 29344457171     PISSN: 11663081     EISSN: 19585780     Source Type: Journal    
DOI: 10.3166/jancl.11.239-267     Document Type: Article

References (44)

1. Chagrov, A. And Zakharyaschev,M. Modal Logic. Oxford University Press, 1997.
2. Dechter, R. Bucket Elimination: A Unifying Framework For Reasoning. Artificial Intelligence, 113, 41-85, 1999. (Pubitemid 30542742)
3. Delgrande, J. P. An Approach To Default Reasoning Based On A First-Order Conditional Logic: Revised Report. Artificial Intelligence, 36:63-90, 1988.
4. Doherty, P., Lukasewicz,W., And Szalas,A. Computing Circumscription Revisited: A Reduction Algorithm. In Mellish, C. S., Editor, Proceedings Of The 14Th International Joint Conference On Artificial Intelligence, Pages 1502-1508. I.J.C.A.I., Morgan Kaufmann, 1995.
5. Dubois, D., Lang, J., And Prade, H., Possibilistic Logic. In Gabbay, D.M., Hogger, C.J., And Robinson, J.A., Editors, Handbook Of Logic In Artificial Intelligence And Logic Programming 3: Nonmonotonic Reasoning And Uncertain Reasoning, Clarendon Press, Oxford, 1994.
6. Dubois, D., And Prade, H., Possibility Theory. Plenum Press, New York, 1988.
7. Dubois, D., And Prade, H., An Introduction To Possibilistic Logic And Fuzzy Logics (With Discussions And Reply). In Smets, P., Mamdani, A., Dubois, D., And Prade, H., Editors Nonstandard Logics For Automated Reasoning, Pages 287-326, Academic Press, 1988.
8. Dubois, D., And Prade, H., Inference In Possibilistic Hypergraphs. In Bouchon-Meunier, B., Yager, R. R., Zadeh, L. A., Editors, Uncertainty In Knowledge Bases, Lecture Notes In Computer Science 521, Pages 250-259, Springer-Verlag, 1990.
9. Gabbay,D. And Ohlbach, H. J. Quantifier Elimination In Second-Order Predicate Logic. Report Mpi-I-92-231, Max-Planck Institut FüR Informatik, SaarbrüCken,Germany, 1992.
10. Gelfond, M., Przymusínska, H., And Przymusínski, T. On The Relationship Between Circumscription And Negation As Failure. Artificial Intelligence, 38(1):75-94, 1989.
11. Gelfond,M., Przymusínska,H., And Przymusínski,T. On The Relationship Betweencwa,Minimal Model, And Minimal Herbrand Model Semantics. International Journal Of Intelligent Systems, 5:549-564, 1990.
12. Ginsberg, M. L. A Circumscriptive Theorem Prover. Artificial Intelligence, 39:209-230, 1989.
13. Hernández, L. D. And Moral, S. Inference With Idempotent Valuations. In Geiger, D. And Shenoy, P. P., Editors, Proceedings Of The Thirteenth Conference On Uncertainty In Artificial Intelligence, Pages 229-237,Morgan Kaufmann, 1997.
14. Inoue, K. Linear Resolution For Consequence Finding. Artificial Intelligence, 56:301-353, 1992.
15. Inoue, K. And Helft, N. On Theorem Provers For Circumscription. In Patel-Schneider, P. F., Editor, Proceedings Of The Eighth Biennial Conference Of The Canadian Society For Computational Studies Of Intelligence, Pages 212-219, 1990.
16. Kohlas, J. Andmoral, S. Propositional Information Systems. Preliminary Report, May 1996.
17. Kohlas, J., Moral, S. And Haenni, R. Propositional Information Systems. Journal Of Logic And Computation, 9(5):651-681, 1999. (Pubitemid 30553024)
18. Kohlas, J. And StäRk, R. F. Information Algebras And Information Systems. Technical Report, Institute Of Informatics, University Of Fribourg, 1996.
19. Lauritzen, S. L. And Spiegelhalter, D. J. Local Computations With Probabilities On Graphical Structures And Their Application To Expert Systems (With Discussion). Journal Of The Royal Statistical Society Ser. B, 50(2):157-224, 1988.
20. Lifschitz, V. Computing Circumscription. In Proceedings Of The 9Th International Joint Conference On Artificial Intelligence, Pages 121-127. I.J.C.A.I., Morgan Kaufmann, 1985.
21. Lifschitz, V. Pointwise Circumscription: Preliminary Report. In Proceedings Of The Fifth National Conference On Artificial Intelligence, Pages 406-410. A.A.A.I., Morgan Kaufmann, 1986.
22. Lifschitz, V. Pointwise Circumscription. In Ginsberg,M. L., Editor, Readings In Nonmonotonic Reasoning, Pages 179-193.Morgan Kaufmann, 1987.
23. Macdermott, D. Nonmonotonic Logic Ii: Nonmonotonicmodal Theories. Journal Of The Association For Computing Machinery, 29:33-57, 1982.
24. Mccarthy, J. M. Applications Of Circumscription To Formalizing Common-Sense Knowledge.
25. Artificial Intelligence, 28:89-116, 1986.
26. Moral, S., Algorithms For Imprecise Probabilities. To Appear In Kohlas, J., And Moral, S., Editors, Handbook Of Defeasible Reasoning And Uncertainty Management Systems, Vol. 5: Algorithms, Kluwer Academic Publishers, 2000.
27. Moore, R. Semantical Considerations On Non-Monotonic Logic. Artificial Intelligence, 25:75- 94, 1985.
28. Moral, S. And Wilson, N. Markov Chain Monte-Carlo Algorithms For The Calculation Of Dempster-Shafer Belief. In Proceedings Of The Twelfth National Conference On Artificial Intelligence (Aaai-94), Pages 269-274, 1994.
29. Nute, D. Conditional Logic. In Gabbay,D. And Guenthner, F., Editors, Handbook Of Philosophical Logic, Vol Ii, Pages 387-439,D. Reidel Publishing Company, 1984.
30. Pearl, J. Probabilistic Reasoning In Intelligent Systems: Networks Of Plausible Inference. Morgan Kaufmann Publishers Inc., 1988.
31. Przymusi'nski, T. An Algorithm To Compute Circumscription. Artificial Intelligence, 38(1):49- 73, 1989.
32. Saffiotti, A. And Umkehrer, E. Pulcinella: A General Tool For Propagating Uncertainty In Valuation Networks. In D'ambrosio, B. D., Smets, P., And Bonissone, P. P., Editors, Uncertainty In Artificial Intelligence: Proceedings Of The 7Th Conference, Pages 323-331. Morgan Kaufmann, 1991.
33. Schwind, C. And Siegel, P. Modal Semantics For Hypothesis Theory. In Proceedings Of The 4Th Internationalworkshop On Nonmonotonic Reasoning, Pages 200-217,May 1992.
34. Shafer, G. And Shenoy, P. P. Probability Propagation. Annals Of Mathematics And Artificial Intelligence, 2:327-352, 1990.
35. Shenoy,P. P. Consistency In Valuation-Based Systems.Orsa Journalon Computing, 6(3):281- 291, 1994.
36. Shenoy, P. P. And Shafer, G. Axioms For Probability And Belief-Function Propagation. In Shafer, G. And Pearl, J., Editors, Readings In Uncertain Reasoning, Pages 575-610.Morgan Kaufmann, 1990.
37. Siegel, P. RepréSentation Et Utilisation De La Connaissance En Calcul Propositionnel. TheSe D'éTat, Université D'aix-Marseille Ii, Luminy, 1987.
38. Stalnaker, R. A Theory Of Conditionals. In Rescher, N., Editor, Studies In Logical Theory, American Philosophical Quarterly Monograpy Series (2), Blackwell, Oxford, 1968.
39. Szalas,A. On Correspondence Betweenmodal And Classical Logic: Automated Approach. Technical Report Mpi-I-92-209, Max-Planck-Institut FüR Informatik, SaarbrüCken, 1992.
40. Truszczy'nski, M. Modal Interpretations Of Default Logic. In Proceedings Of The 12Th International Joint Conference On Artificial Intelligence, Pages 393-398. I.J.C.A.I., Morgan Kaufmann, 1991.
41. Wilson, N. Extended Probability. In Wahlster, W., Editor, Proceedings Of The 12Th European Conference On Artificial Intelligence (Ecai-96), Pages 667-771. Johnwiley And Sons Ltd, 1996.
42. Wilson, N. And Mengin, J. Logical Deduction Using The Local Computation Framework. In Bonacina,M. P. And Furbach, U., 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.
43. Wilson, N. And Mengin, J. Logical Deduction Using The Local Computation Framework. In Hunter, A. And Parsons, S., Editors, Symbolic And Quantitative Approaches To Reasoning And Uncertainty (Ecsqaru'99), Lecture Notes In Computer Science 1638, Pages 386- 396. Springer, 1999.
44. Wilson, N. And Moral, S. A Logical View Of Probability. In Proceedings Of The 11Th European Conference On Artificial Intelligence (Ecai-94), Pages 386-390, 1994.