Skip to main content

Reasoning with Actions in Transaction Logic

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6902))

Abstract

This paper introduces TR PAD (Transaction Logic with Partially Defined Actions)—an expressive formalism for reasoning about the effects of compound actions. TR PAD is based on a subset of Transaction Logic, but extends it with special premise-formulas that generalize the data and transition formulas of the original Transaction Logic. We develop a sound and complete proof theory for TR PAD and illustrate the formalism on a number of non-trivial examples. In addition, we show that most of TR PAD is reducible to ordinary logic programming and that this reduction is sound and complete.

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

Buying options

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. Baral, C., Gelfond, M.: Representing concurrent actions in extended logic programming. In: Proceedings of the 13th International Joint Conference on Artifical Intelligence, vol. 2, pp. 866–871. Morgan Kaufmann Publishers Inc., San Francisco (1993)

    Google Scholar 

  2. Baral, C., Gelfond, M.: Reasoning agents in dynamic domains, pp. 257–279. Kluwer Academic Publishers, Norwell (2000)

    MATH  Google Scholar 

  3. Baral, C., Gelfond, M.: Reasoning about intended actions. In: Proceedings of the 20th National Conference on Artificial Intelligence, vol. 2, pp. 689–694. AAAI Press, Menlo Park (2005)

    Google Scholar 

  4. Baral, C., Gelfond, M., Provetti, A.: Representing actions: Laws, observations and hypotheses. Journal of Logic Programming (1997)

    Google Scholar 

  5. Bonner, A.J., Kifer, M.: Transaction logic programming. In: Int’l Conference on Logic Programming, pp. 257–282. MIT Press, Budapest (June 1993)

    Google Scholar 

  6. Bonner, A.J., Kifer, M.: Applications of transaction logic to knowledge representation. In: Gabbay, D.M., Ohlbach, H.J. (eds.) ICTL 1994. LNCS, vol. 827, pp. 67–81. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  7. Bonner, A.J., Kifer, M.: Transaction logic programming (or a logic of declarative and procedural knowledge). Technical Report CSRI-323, University of Toronto (November 1995), http://www.cs.sunysb.edu/~kifer/TechReports/transaction-logic.pdf

  8. Bonner, A.J., Kifer, M.: A logic for programming database transactions. In: Chomicki, J., Saake, G. (eds.) Logics for Databases and Information Systems. ch.5, pp. 117–166. Kluwer Academic Publishers, Dordrecht (March 1998)

    Chapter  Google Scholar 

  9. Gelfond, M., Lifschitz, V.: Representing action and change by logic programs. Journal of Logic Programming 17, 301–322 (1993)

    Article  MATH  Google Scholar 

  10. Hanks, S., McDermott, D.: Nonmonotonic logic and temporal projection. Artif. Intell. 33(3), 379–412 (1987)

    Article  MATH  Google Scholar 

  11. Kifer, M.: FLORA-2: An object-oriented knowledge base language. The FLORA-2 Web Site, http://flora.sourceforge.net

  12. Lam, P.E., Mitchell, J.C., Sundaram, S.: A formalization of HIPAA for a medical messaging system. In: Fischer-Hübner, S., Lambrinoudakis, C., Pernul, G. (eds.) TrustBus 2009. P.E. Lam, J.C. Mitchell, S. Sundaram, vol. 5695, pp. 73–85. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Pearce, D., Wagner, G.: Logic programming with strong negation. In: Proceedings of the International Workshop on Extensions of logic programming, pp. 311–326. Springer-Verlag New York, Inc., New York (1991)

    Chapter  Google Scholar 

  14. Rezk, M., Kifer, M.: On the Equivalence Between the L1 Action Language and Partial Actions in Transaction Logic. Submitted for Publication (2011)

    Google Scholar 

  15. Rezk, M., Kifer, M.: Reasoning with actions in transaction logic (2011), http://www.inf.unibz.it/~mrezk/techreportPAD.pdf

  16. Turner, H.: Representing actions in default logic: A situation calculus approach. In: Proceedings of the Symposium in honor of Michael Gelfond’s 50th birthday (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rezk, M., Kifer, M. (2011). Reasoning with Actions in Transaction Logic. In: Rudolph, S., Gutierrez, C. (eds) Web Reasoning and Rule Systems. RR 2011. Lecture Notes in Computer Science, vol 6902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23580-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23580-1_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23579-5

  • Online ISBN: 978-3-642-23580-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics