Skip to main content

A Rule-Based System for Computation and Deduction in Mathematica

  • Conference paper
  • First Online:
Rewriting Logic and Its Applications (WRLA 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12328))

Included in the following conference series:

  • 180 Accesses

Abstract

\(\rho \hbox {Log}\) is a system for rule-based programming implemented in Mathematica, a state-of-the-art system for computer algebra. It is based on the usage of (1) conditional rewrite rules to express both computation and deduction, and of (2) patterns with sequence variables, context variables, ordinary variables, and function variables, which enable natural and concise specifications beyond the expressive power of first-order logic. Rules can be labeled with various kinds of strategies, which control their application. Our implementation is based on a rewriting-based calculus proposed by us, called \(\rho \hbox {Log}\) too. We describe the capabilities of our system, the underlying \(\rho \hbox {Log}\) calculus and its main properties, and indicate some applications.

This work was supported by Shota Rustaveli National Science Foundation of Georgia under the grant no. FR17 439 and by the Austrian Science Fund (FWF) under project 28789-N32.

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

Access this chapter

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

Notes

  1. 1.

    By ‘first occurrence’ in (1), we mean first occurrence in the sequence of expressions (stgt), \(cond_1,\ldots ,cond_n,t'\).

References

  1. Ahmed, T., Sandhu, R.: Safety of ABAC\(_\alpha \) is decidable. In: Yan, Z., Molva, R., Mazurczyk, W., Kantola, R. (eds.) NSS 2017. LNCS, vol. 10394, pp. 257–272. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-64701-2_19

    Chapter  Google Scholar 

  2. Aït-Kaci, H., Pasi, G.: Fuzzy unification and generalization of first-order terms over similar signatures. In: Fioravanti, F., Gallagher, J.P. (eds.) LOPSTR 2017. LNCS, vol. 10855, pp. 218–234. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94460-9_13

    Chapter  MATH  Google Scholar 

  3. Buchberger, B., Jebelean, T., Kriftner, F., Marin, M., Tomuţa, E., Văsaru, D.: A survey of the Theorema project. In: Proceedings of ISSAC 1997, Maui, Hawaii, USA, pp. 384–391 (1997)

    Google Scholar 

  4. Dundua, B., Kutsia, T., Reisenberger-Hagmayer, K.: An overview of P\(\rho \)Log. In: Lierler, Y., Taha, W. (eds.) PADL 2017. LNCS, vol. 10137, pp. 34–49. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-51676-9_3

    Chapter  Google Scholar 

  5. Jebelean, T., Drămnesc, I.: Synthesis of list algorithms by mechanical proving. JSC 69, 61–92 (2015)

    MathSciNet  MATH  Google Scholar 

  6. Jin, X., Krishnan, R., Sandhu, R.: A unified attribute-based access control model covering DAC, MAC and RBAC. In: Cuppens-Boulahia, N., Cuppens, F., Garcia-Alfaro, J. (eds.) DBSec 2012. LNCS, vol. 7371, pp. 41–55. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31540-4_4

    Chapter  Google Scholar 

  7. Jin, X.: Attribute-based access control models and implementation in cloud infrastructure as a service. Ph.D. thesis, University of Texas at San Antonio (2014)

    Google Scholar 

  8. Kutsia, T.: Solving equations with sequence variables and sequence functions. JSC 42(3), 352–388 (2007)

    MathSciNet  MATH  Google Scholar 

  9. Kutsia, T.: Solving equations involving sequence variables and sequence functions. In: Buchberger, B., Campbell, J. (eds.) AISC 2004. LNCS (LNAI), vol. 3249, pp. 157–170. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30210-0_14

    Chapter  MATH  Google Scholar 

  10. Kutsia, T., Marin, M.: Can context sequence matching be used for querying XML? In: Vigneron, L. (ed.) Proceedings of the 19th International Workshop on Unification (UNIF 2005), Nara, Japan, pp. 77–92 (2005)

    Google Scholar 

  11. Kutsia, T., Marin, M.: Matching with regular constraints. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 215–229. Springer, Heidelberg (2005). https://doi.org/10.1007/11591191_16

    Chapter  Google Scholar 

  12. Marin, M., Kutsia, T.: Foundations of the rule-based system \(\rho \)Log. J. Appl. Non Cl. Log. 16(1–2), 151–168 (2006)

    Article  MathSciNet  Google Scholar 

  13. Marin, M., Kutsia, T., Dundua, B.: A rule-based approach to the decidability of safety of ABAC\(_{\alpha }\). In: Proceedings of the 24th ACM Symposium on Access Control Models and Technologies, SACMAT 2019, New York, NY, USA, pp. 173–178. Association for Computing Machinery (2019). https://doi.org/10.1145/3322431.3325416

  14. Marin, M., Piroi, F.: Deduction and presentation in \(\rho \)log. In: Proceedings of MKM. ENTCS, vol. 93, pp. 161–182 (2004)

    Google Scholar 

  15. Marin, M., Piroi, F.: Rule-based programming with mathematica. In: Proceedings of International Mathematica Symposium (IMS 2004), Banff, Canada (2004)

    Google Scholar 

  16. Wolfram, S.: The Mathematica Book, 5 edn. Wolfram Media (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mircea Marin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Marin, M., Dundua, B., Kutsia, T. (2020). A Rule-Based System for Computation and Deduction in Mathematica. In: Escobar, S., Martí-Oliet, N. (eds) Rewriting Logic and Its Applications. WRLA 2020. Lecture Notes in Computer Science(), vol 12328. Springer, Cham. https://doi.org/10.1007/978-3-030-63595-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-63595-4_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-63594-7

  • Online ISBN: 978-3-030-63595-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics