Skip to main content
SpringerLink
Log in

Action and Change in Rewriting Logic

  • Chapter
Dynamic Worlds

Part of the book series: Applied Logic Series ((APLS,volume 12))

Abstract

After making precise what we mean and do not mean by “the frame problem” and discussing some recent approaches, we summarize the main features of the solution offered by rewriting logic.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Agha, Actors, The MIT Press, 1986.

    Google Scholar 

  2. J.-M. Andreoli and R. Pareschi, LO and behold! Concurrent structured processes, in: N. Meyrowitz (ed.), Proc. OOPSLA-ECOOP’90, ACM Press, 1990, pages 44–56.

    Chapter  Google Scholar 

  3. J.-M. Andreoli and R. Pareschi, Linear Objects: Logical processes with built-in inheritance, New Generation Computing 9, 1991, pages 445–473.

    Article  Google Scholar 

  4. A. Asperti, A logic for concurrency, unpublished manuscript, November 1987.

    Google Scholar 

  5. J.-P. Banâtre and D. Le Mètayer, The Gamma model and its discipline of programming, Science of Computer Programming 15, 1990, pages 55–77.

    Article  Google Scholar 

  6. M. Barr, s-Autonomous Categories, LNM 752, Springer-Verlag, 1979.

    Google Scholar 

  7. G. Berry and G. Boudol, The chemical abstract machine, Theoretical Computer Science 96, 1992, pages 217–248.

    Article  Google Scholar 

  8. W. Bibel, A deductive solution for plan generation, New Generation Computing 4, 1986, pages 115–132.

    Article  Google Scholar 

  9. C. Brown, Relating Petri nets to formulae of linear logic, Technical report ECS-LFCS89–87, Laboratory for Foundations of Computer Science, University of Edinburgh, June 1989.

    Google Scholar 

  10. S. Brüning, G. Große, S. Hölldobler, J. Schneeberger, U. Sigmund, and M. Thielscher, Disjunction in plan generation by equational logic programming, in: A. Horz (ed.), Beiträge zum 7. Workshop Plannen und Konfigurieren, Arbeitspapiere der GMD 723, 1993, pages 18–26.

    Google Scholar 

  11. K. M. Chandy and J. Misra, Parallel Program Design: A Foundation, Addison-Wesley, 1988.

    Google Scholar 

  12. K. M. Chandy and S. Taylor, An Introduction to Parallel Programming, Jones and Bartlett Publishers, 1992.

    Google Scholar 

  13. M. Clavel, S. Eker, P. Lincoln, and J. Meseguer, Principles of Maude, in: J. Meseguer (ed.), Proc. First Int. Workshop on Rewriting Logic and its Applications, Asilomar, California, Electronic Notes in Theoretical Computer Science 4, Elsevier, September 1996. URL http://vvvl.elsevier.nl/mcs/tcs/pc/volume4.htm

    Google Scholar 

  14. J. R. B. Cockett and R. A. G. Seely, Weakly distributive categories, in: M. P. Fourman, P. T. Johnstone, and A. M. Pitts (eds.), Applications of Categories in Computer Science, Cambridge University Press, 1992, pages 45–65.

    Google Scholar 

  15. P. Degano, J. Meseguer, and U. Montanan, Axiomatizing the algebra of net computations and processes, Acta Informatica 33, 1996, pages 641–667.

    Google Scholar 

  16. J. Engelfriet, G. Leih, and G. Rozenberg, Net-based description of parallel object-based systems, or POTs and POPs, in: J. W. de Bakker, W. P. de Roever, and G. Rozenberg (eds.), Proc. REX School/Workshop on Foundations of Object-Oriented Languages, Noordwijkerhout, The Netherlands, May/June 1990, LNCS 489, Springer-Verlag, 1991, pages 229–273.

    Google Scholar 

  17. R. E. Fikes and N. J. Nilsson, STRIPS: A new approach to the application of theorem proving to problem solving, Artificial Intelligence 2, 1971, pages 189–208.

    Article  Google Scholar 

  18. M. R. Genesereth and N. J. Nilsson, Logical Foundations of Artificial Intelligence, Morgan Kaufmann Publishers, 1987.

    Google Scholar 

  19. J.-Y. Girard, Linear logic, Theoretical Computer Science 50, 1987, pages 1–102.

    Article  Google Scholar 

  20. J. A. Goguen and R. M. Burstall, Institutions: Abstract model theory for specification and programming, Journal of the Association for Computing Machinery 39 (1), 1992, pages 95–146.

    Article  Google Scholar 

  21. J. A. Goguen and J. Meseguer, Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations, Theoretical Computer Science 105, 1992, pages 217–273.

    Article  Google Scholar 

  22. J. A. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.-P. Jouannaud, Introducing OBJ, Technical report SRI-CSL-92–03, Computer Science Laboratory, SRI International, March 1992. To appear in J. A. Goguen and G. Malcolm (eds.), Software Engineering with OBJ: Algebraic Specification in Practice, Cambridge University Press.

    Google Scholar 

  23. G. Große, S. Hölldobler, and J. Schneeberger, Linear deductive planning, Journal of Logic and Computation 6 (2), 1996, pages 233–262.

    Article  Google Scholar 

  24. G. Große, S. Hölldobler, J. Schneeberger, U. Sigmund, and M. Thielscher, Equational logic programming, actions, and change, in: K. Apt (ed.), Proc. Int. Joint Conf. and Symp. on Logic Programming, The MIT Press, 1992, pages 177–191.

    Google Scholar 

  25. C. Gunter and V. Gehlot, Nets as tensor theories, Technical report MS-CIS-89–68 Logic and Computation 17, Department of Computer and Information Science, University of Pennsylvania, October 1989.

    Google Scholar 

  26. P. J. Hayes, The second naive physics manifesto, in: J. R. Hobbs and R. C. Moore (eds.), Formal Theories of the Commonsense World, Ablex Publishing Corp., 1985, pages 1–36. Reprinted in: R. J. Brachman and H. J. Levesque (eds.), Readings in Knowledge Representation, Morgan Kaufmann Publishers, 1985, pages 467–485.

    Google Scholar 

  27. P. J. Hayes, What the frame problem is and isn’t, in: Z. W. Pylyshyn (ed.), The Robot’s Dilemma: The Frame Problem in Artificial Intelligence, Ablex Publishing Corp., 1987, pages 123–137.

    Google Scholar 

  28. S. Hölldobler, On deductive planning and the frame problem, in: A. Voronkov (ed.), Logic Programming and Automated Reasoning, St. Petersburg, Russia, July 1992, LNAI 624, Springer-Verlag, 1992, pages 13–29.

    Google Scholar 

  29. S. Hölldobler and J. Schneeberger, A new deductive approach to planning, New Generation Computing 8, 1990, pages 225–244.

    Article  Google Scholar 

  30. L.-E. Janlert, Modeling change—The frame problem, in: Z. W. Pylyshyn (ed.), The Robot’s Dilemma: The Frame Problem in Artificial Intelligence, Ablex Publishing Corp., 1987, pages 1–40.

    Google Scholar 

  31. C. Laneve and U. Montanan, Axiomatizing permutation equivalence, Mathematical Structures in Computer Science 6 (3), 1996, pages 219–249.

    Article  Google Scholar 

  32. P. Lincoln, N. Marti-Oliet, and J. Meseguer, Specification, transformation, and programming of concurrent systems in rewriting logic, in: G. E. Blelloch, K. M. Chandy, and S. Jagannathan (eds.), Specification of Parallel Algorithms, DIMACS Workshop, May 1994, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 18, American Mathematical Society, 1994, pages 309–339.

    Google Scholar 

  33. P. Lincoln, N. Marti-Oliet, J. Meseguer, and L. Ricciulli, Compiling rewriting onto SIMD and MIMD/SIMD machines, in: C. Halatsis et al. (eds.), Proc. PARLE’94, Sixth Int. Conf. on Parallel Architectures and Languages Europe, Athens, Greece, July 1994, LNCS 817, Springer-Verlag, 1994, pages 37–48.

    Google Scholar 

  34. S. Mac Lane, Categories for the Working Mathematician, Springer-Verlag, 1971.

    Google Scholar 

  35. N. Marti-Oliet and J. Meseguer, From Petri nets to linear logic, Mathematical Structures in Computer Science 1, 1991, pages 69–101.

    Article  Google Scholar 

  36. N. Marti-Oliet and J. Meseguer, From Petri nets to linear logic through categories: A survey, International Journal of Foundations of Computer Science 2 (4), 1991, pages 297–399.

    Article  Google Scholar 

  37. N. Marti-Oliet and J. Meseguer, Rewriting logic as a logical and semantic framework, Technical report SRI-CSL-93–05, Computer Science Laboratory, SRI International, August 1993. To appear in D. M. Gabbay (ed.), Handbook of Philosophical Logic, Kluwer Academic Publishers.

    Google Scholar 

  38. N. Marti-Oliet and J. Meseguer, General logics and logical frameworks, in: D. Gabbay (ed.), What Is a Logical System?, Oxford University Press, 1994, pages 355–392.

    Google Scholar 

  39. M. Masseron, C. Tollu, and J. Vauzeilles, Generating plans in linear logic, in: K. V. Nori and C. E. Veni Madhavan (ads.), Foundations of Software Technology and Theoretical Computer Science, Bangalore, India, December 1990, LNCS 472, Springer-Verlag, 1990, pages 63–75.

    Google Scholar 

  40. M. Masseron, C. Tollu, and J. Vauzeilles, Generating plans in linear logic I: Actions as proofs, Theoretical Computer Science 113 (2), 1993, pages 349–370.

    Article  Google Scholar 

  41. J. McCarthy and P. J. Hayes, Some philosophical problems from the standpoint of artificial intelligence, in: B. Meltzer and D. Michie (eds.), Machine Intelligence 4, Edinburgh University Press, 1969, pages 463–502.

    Google Scholar 

  42. D. McDermott, AI, logic, and the frame problem, in: F. M. Brown (ed.), Proc. 1987 Workshop on the Frame Problem in Artificial Intelligence, Morgan Kaufmann Publishers, 1987, pages 105–118.

    Google Scholar 

  43. D. V. McDermott, Logic, problem solving, and deduction, in: J. F. Traub et al. (eds.), Annual Review of Computer Science, Volume 2, Annual Reviews Inc., 1987, pages 187–229.

    Google Scholar 

  44. J. Meseguer, General logics, in: H.-D. Ebbinghaus et al. (eds.), Logic C,olloquium’87, North-Holland, 1989, pages 275–329.

    Google Scholar 

  45. J. Meseguer, A logical theory of concurrent objects, in: N. Meyrowitz (ed.), Proc. OOPSLA-ECOOP’90, ACM Press, 1990, pages 101–115.

    Chapter  Google Scholar 

  46. J. Meseguer, Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science 96, 1992, pages 73–155.

    Article  Google Scholar 

  47. J. Meseguer, Multiparadigm logic programming, in: H. Kirchner and G. Levi (eds.), Proc. Third Int. Conf. on Algebraic and Logic Programming, Volterra, Italy, September 1992, LNCS 632, Springer-Verlag, 1992, pages 158–200.

    Google Scholar 

  48. J. Meseguer, A logical theory of concurrent objects and its realization in the Maude language, in: G. Agha, P. Wegner, and A. Yonezawa (eds.), Research Directions in Object-Based Concurrency, The MIT Press, 1993, pages 314–390.

    Google Scholar 

  49. J. Meseguer, Solving the inheritance anomaly in concurrent object-oriented programming, in: O. M. Nierstrasz (ed.), Proc. ECOOP’93, 7th European Conf., Kaiserslautern, Germany, July 1993, LNCS 707, Springer-Verlag, 1993, pages 220–246.

    Google Scholar 

  50. J. Meseguer and J. A. Goguen, Order-sorted algebra solves the constructor-selector, multiple representation and coercion problems, Information and Computation 104, 1993, pages 114–158.

    Article  Google Scholar 

  51. J. Meseguer, J. A. Goguen, and G. Smolka, Order-sorted unification, Journal of Symbolic Computation 8, 1989, pages 383–413.

    Article  Google Scholar 

  52. J. Meseguer and U. Montanari, Petri nets are monoids, Information and Computation 88, 1990, pages 105–155.

    Article  Google Scholar 

  53. J. Meseguer and X. Qian, A logical semantics for object-oriented databases, in: P. Buneman and S. Jajodia (eds.), Proc. 1993 ACM SIGMOD, Int. Conf. on Management of Data, SIGMOD Record 22(2), June 1993, pages 89–98.

    Chapter  Google Scholar 

  54. J. Meseguer and T. Winkler, Parallel programming in Maude, in: J. P. Banâtre and D. Le Métayer (eds.), Research Directions in High-Level Parallel Programming Languages, LNCS 574, Springer-Verlag, 1992, pages 253–293.

    Chapter  Google Scholar 

  55. R. Milner, Communication and Concurrency, Prentice Hall, 1989.

    Google Scholar 

  56. N. J. Nilsson, Logic and artificial intelligence, Artificial Intelligence 47, 1991, pages 31–56.

    Article  Google Scholar 

  57. G. Reichwein, J. L. Fiadeiro, and T. Maibaum, Modular reasoning about change in an object-oriented framework, abstract presented at the Workshop Logic and Change at GWAI’92, September 1992.

    Google Scholar 

  58. W. Reisig, Petri Nets: An Introduction, Springer-Verlag, 1985.

    Google Scholar 

  59. E. Sandewall, Features and fluents, Research report LiTH-IDA-R-92–30, Department of Computer and Information Science, Linköping University, Sweden, September 1992.

    Google Scholar 

  60. V. J. Saraswat, Concurrent Constraint Programming, The MIT Press, 1992.

    Google Scholar 

  61. R. A. G. Seely, Linear logic, s-autonomous categories and cofree coalgebras, in: J. W. Gray and A. Scedrov (eds.), Categories in Computer Science and Logic, Boulder, June 1987, Contemporary Mathematics 92, American Mathematical Society, 1989, pages 371–382.

    Google Scholar 

  62. E. Shapiro, The family of concurrent logic programming languages, ACM Computing Surveys 21, 1989, pages 412–510.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Sistemas Informáticos y Programación Facultad de Ciencias Matemáticas, Universidad Complutense de Madrid, Spain

    Narciso Martí-Oliet

  2. SRI International, Menlo Park, USA

    José Meseguer

  3. Center for the Study of Language and Information, Stanford University, USA

    José Meseguer

Authors
  1. Narciso Martí-Oliet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Meseguer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Xerox Research Centre Europe, Meylan, France

    Remo Pareschi

  2. Technische Universität München, Germany

    Bertram Fronhöfer

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Martí-Oliet, N., Meseguer, J. (1999). Action and Change in Rewriting Logic. In: Pareschi, R., Fronhöfer, B. (eds) Dynamic Worlds. Applied Logic Series, vol 12. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1317-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-1317-7_1

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5159-2

  • Online ISBN: 978-94-017-1317-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation