Advertisement

A compositional reasoning system for executing nonmonotonic theories of reasoning

  • J. Engelfriet
  • J. Treur
Accepted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1244)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BDJT97]
    Brazier, F.M.T., Dunin-Keplicz, B., Jennings, N.R., Treur, J.: “DESIRE: Modelling Multi-Agent Systems in a Compositional Formal Framework”, International Journal of Cooperative Information Systems 6 (1997), Special Issue on Formal Methods in Cooperative Information Systems: Multi-Agent Systems (M. Huhns, M. Singh, eds.), in press. Shorter version in: V. Lesser (ed.), Proc. of the First International Conference on Multi-Agent Systems, ICMAS-95, MIT Press, 1995, pp. 25–32Google Scholar
  2. [BTWW95]
    Brazier, F.M.T., Treur, J., Wijngaards, N.J.E., Willems, M.: “Formal Specification of Hierarchically (De)composed Tasks”, in: B.R. Gaines, M.A. Musen (eds.), Proceedings of the 9th Banff Knowledge Acquisition for Knowledge-Based Systems Workshop, KAW'95, SRDG Publications, 1995, pp. 25/1–25/20Google Scholar
  3. [Br94]
    Brewka, G.: “Adding Priorities and Specificity to Default Logic”, in: C. MacNish, D. Pearce, L.M. Pereira (eds.), Logics in Artificial Intelligence, Proceedings of the 4th European Workshop on Logics in Artificial Intelligence, JELIA '94, Lecture Notes in Artificial Intelligence 838, Springer-Verlag, 1994, pp. 247–260Google Scholar
  4. [CMT96]
    Cholewinski, P., Marek, V.W., Truszczynski, M.: “Default Reasoning System DeReS”, in: Proceedings 5th International Conference on Principles of Knowledge Representation and Reasoning, KR-96, Morgan Kaufmann, 1996.Google Scholar
  5. [ET93]
    Engelfriet, J., Treur, J.: “A Temporal Model Theory for Default Logic”, in: M. Clarke, R. Kruse, S. Moral (eds.), Proceedings 2nd European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, ECSQARU '93, Lecture Notes in Computer Science 747, Springer-Verlag, 1993, pp. 91–96Google Scholar
  6. [ET94]
    Engelfriet, J., Treur, J.: “Temporal Theories of Reasoning”, in: C. MacNish, D. Pearce, L.M. Pereira (eds.), Logics in Artificial Intelligence, Proceedings of the 4th European Workshop on Logics in Artificial Intelligence, JELIA '94, Lecture Notes in Artificial Intelligence 838, Springer-Verlag, 1994, pp. 279–299. Also in: Journal of Applied Non-Classical Logics 5(2), 1995, pp. 239–261Google Scholar
  7. [ET96]
    Engelfriet, J., Treur, J.: “Specification of Nonmonotonic Reasoning”, in: D.M. Gabbay, H.J. Ohlbach (eds.), Practical Reasoning, International Conference on Formal and Applied Practical Reasoning, FAPR'96, Lecture Notes in Artificial Intelligence 1085, Springer-Verlag, 1996, pp. 111–125Google Scholar
  8. [ET97]
    Engelfriet, J., Treur, J.: “Executable Temporal Logic for Nonmonotonic Reasoning”, to appear in Journal of Symbolic Computation, Special issue on Executable Temporal LogicGoogle Scholar
  9. [FO95]
    Fisher, M., Owens, R. (eds.): Executable Modal and Temporal Logics, Proceedings of the IJCAI'93 workshop, Lecture Notes in Artificial Intelligence 897, Springer-Verlag, 1995Google Scholar
  10. [Ga89]
    Gabbay, D.: “The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems”, in: B. Banieqbal, H. Barringer, A. Pnueli (eds.), Temporal Logic in Specification, Lecture Notes in Computer Science 398, Springer-Verlag, pp. 409–448Google Scholar
  11. [LPT92]
    Langevelde, I.A. van, Philipsen, A.W., Treur, J.: “Formal Specification of Compositional Architectures”, in: B. Neumann (ed.), Proceedings of the 10th European Conference on Artificial Intelligence, ECAI'92, John Wiley & Sons, pp. 272–276Google Scholar
  12. [Ni95]
    Niemelä, I.,: “Towards Efficient Default Reasoning”, in: Proceedings 14th IJCA1, Morgan Kaufmann, 1995, pp. 312–318Google Scholar
  13. [Ni96]
    Niemelä, I.,: “Implementing Circumscription Using a Tableau Method”, in: W. Wahlster (ed.), Proceedings 12th European Conference on Artificial Intelligence, ECAI'96, John Wiley & Sons, pp. 80–84Google Scholar
  14. [RS94]
    Risch, V., Schwind, C.B.: “Tableau-Based Characterization and Theorem Proving for Default Logic”, Journal of Automated Reasoning 13: 223–242, 1994Google Scholar
  15. [SB96]
    Schaub, T., Brüning, S.: “Prolog technology for default reasoning (An abridged report)”, in: W. Wahlster (ed.), Proceedings 12th European Conference on Artificial Intelligence, ECAI'96, John Wiley & Sons, pp. 105–109Google Scholar
  16. [TT92]
    Tan, Y.H., Treur, J.: “Constructive Default Logic and the Control of Defeasible Reasoning”, in: B. Neumann (ed.), Proceedings of the 10th European Conference on Artificial Intelligence, ECAI'92, John Wiley & Sons, pp. 299–303Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • J. Engelfriet
    • 1
  • J. Treur
    • 1
  1. 1.Faculty of Mathematics and Computer ScienceVrije Universiteit AmsterdamHV AmsterdamThe Netherlands

Personalised recommendations