Skip to main content
SpringerLink
Log in

Deciding the Bisimilarity Relation between Datalog Goals

  • Conference paper
Book cover Logics in Artificial Intelligence (JELIA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7519))

Included in the following conference series:

  • 839 Accesses

Abstract

We introduce the concept of bisimulation between Datalog goals: two Datalog goals are bisimilar with respect to a given Datalog program when their SLD-trees, considered as relational structures, are bisimilar. We address the problem of deciding whether two given goals are bisimilar with respect to given programs. When the given programs are hierarchical or restricted, this problem is decidable in 2EXPTIME.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bol, R.N.: Loop Checking in Partial Deduction. J. Logic Programming 16, 25–46 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bol, R.N., Apt, K.R., Klop, J.W.: An Analysis of Loop Checking Mechanisms for Logic Programs. Theoretical Computer Science 86, 35–79 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  3. Devienne, P., Lebégue, P., Routier, J.-C.: Halting Problem of One Binary Horn Clause is Undecidable. In: Enjalbert, P., Wagner, K.W., Finkel, A. (eds.) STACS 1993. LNCS, vol. 665, pp. 48–57. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  4. Gabbrielli, M., Levi, G., Meo, M.C.: Observable Behaviors and Equivalences of Logic Programs 122, 1–29 (1992)

    Google Scholar 

  5. Harland, J.: On Normal Forms and Equivalence for Logic Programs. In: Proceedings of the Joint International Conference and Symposium on Logic Programming, pp. 146–160 (1992)

    Google Scholar 

  6. Hennessy, M., Milner, R.: On Observing Nondeterminism and Concurrency. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 299–309. Springer, Heidelberg (1980)

    Chapter  Google Scholar 

  7. Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21, 666–677 (1978)

    Article  MATH  Google Scholar 

  8. Lifschitz, V., Pearce, D., Valverde, A.: Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic (2000)

    Google Scholar 

  9. Lloyd, J.W.: Foundations in Logic Programming. Springer (1984)

    Google Scholar 

  10. Maher, M.: Equivalences of Logic Programs. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol. 225, pp. 410–424. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  11. Milner, R.: Calculi for synchrony and asynchrony. Theoretical Computer Science 25, 267–310 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  12. Park, D.: Concurrency and Automata on Infinite Sequences. In: Proceedings of the 5th GI-Conference on Theoretical Computer Science, pp. 167–183. Springer, UK (1981)

    Chapter  Google Scholar 

  13. Sangiorgi, D.: On the origins of bisimulation and coinduction. In: ACM Trans. Program. Lang. Syst., pp. 1–41. ACM, USA (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut de Recherche en Informatique de Toulouse, CNRS — Université de Toulouse, 118 route de Narbonne, 31062, Toulouse Cedex 9, France

    Philippe Balbiani & Antoun Yaacoub

Authors
  1. Philippe Balbiani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antoun Yaacoub
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut de Recherche en Informatique de Toulouse, 118 route de Narbonne, 31062, Toulouse Cedex 9, France

    Luis Fariñas del Cerro , Andreas Herzig  & Jérôme Mengin ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Balbiani, P., Yaacoub, A. (2012). Deciding the Bisimilarity Relation between Datalog Goals. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds) Logics in Artificial Intelligence. JELIA 2012. Lecture Notes in Computer Science(), vol 7519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33353-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33353-8_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33352-1

  • Online ISBN: 978-3-642-33353-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation