Skip to main content
SpringerLink
Log in

Invertible Bidirectional Metalogical Translation Between Prolog and RuleML for Knowledge Representation and Querying

  • Conference paper
  • First Online:
Rules and Reasoning (RuleML+RR 2020)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 12173))

Included in the following conference series:

Abstract

The paper presents BiMetaTrans(Prolog, RuleML), an invertible bidirectional metalogical translator across subsets of ISO Prolog and RuleML/XML 1.02 on the level of Negation-as-failure Horn logic with Equality. BiMetaTrans, itself written in Prolog, introduces a tighter integration between RuleML and Prolog, which enables the reuse of, e.g., RuleML Knowledge Bases (KBs) and query engines. A Prolog/’$V’ encoding is defined as the BiMetaTrans translation source-and-target counterpart to RuleML/XML. This metalogical encoding, along with the introduction of the split translation pattern, allows BiMetaTrans to build upon the abstraction of Definite Clause Grammars (DCGs), supporting invertible bi-translation. The BiMetaTrans DCG is explored and an invertibility proof is outlined. BiMetaTrans is exemplified for knowledge representation and querying applied to an Air Traffic Control KB.

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

    https://github.com/mthom/scryer-prolog/blob/master/src/examples/bimetatrans/.

  2. 2.

    See penultimate row of http://deliberation.ruleml.org/1.02/relaxng/#anchor table. Also note row for NafNegHornlogEq on the sublanguage path to NafFologEq. Our initial version of BiMetaTrans – like Prolog – assumes ordered conjunctions, disjunctions, and rulebases, although the corresponding RuleML/XML formula edges with index="1", index="2", ... attributes (http://wiki.ruleml.org/index.php/Glossary_of_Deliberation_RuleML_1.02#.40index) are omitted for simplicity.

  3. 3.

    http://wiki.ruleml.org/index.php/Specification_of_Deliberation_RuleML_1.02#XSLT-Based_Compactifiers.

  4. 4.

    https://wiki.ruleml.org/index.php/Glossary_of_Deliberation_RuleML_1.02#.40mapClosure.

  5. 5.

    https://www.metalevel.at/prolog/dcg#implementation.

  6. 6.

    Complementing RuleML’s xsi:type, we introduce iso:type for ISO Prolog types.

  7. 7.

    The <RuleML> root is assumed by BiMetaTrans(Prolog/’$V’, RuleML/XML), thus simplifying its various (KB-only, query-only, KB&query) translation uses.

  8. 8.

    A conclusion compound with function symbol ’=’ is not permissible in an ISO Prolog KB, but we are concerned only with Prolog/’$V’ encodings as ground terms.

  9. 9.

    http://users.ntua.gr/mitsikas/ATC_KB/ATC_KB_ISO_PL.pl.

  10. 10.

    In the Emacs text editor, the reification can be done by the interactive command M-x query-replace-regexp with basically as the matching expression and as the transform. Such a command could also be named as an Emacs Lisp function.

  11. 11.

    https://github.com/mthom/scryer-prolog.

  12. 12.

    https://github.com/mthom/scryer-prolog#strings-and-partial-strings.

References

  1. Iamnitchi, A., Trunfio, P., Ledlie, J., Schintke, F.: Peer-to-peer computing. In: D’Ambra, P., Guarracino, M., Talia, D. (eds.) Euro-Par 2010. LNCS, vol. 6271, pp. 444–445. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15277-1_42

  2. Kravari, K., Bassiliades, N., Boley, H.: Cross-community interoperation between knowledge-based multi-agent systems: a study on EMERALD and Rule Responder. Expert Syst. Appl 39(10), 9571–9587 (2012)

    Article  Google Scholar 

  3. Sterling, L., Shapiro, E.Y.: The Art of Prolog: Advanced Programming Techniques. MIT Press, Cambridge (1994)

    MATH  Google Scholar 

  4. Mitsikas, T., Stefaneas, P., Ouranos, I.: A rule-based approach for air traffic control in the vicinity of the airport. In: Lambropoulou, S., Theodorou, D., Stefaneas, P., Kauffman, L.H. (eds.) AlModTopCom 2015. SPMS, vol. 219, pp. 423–438. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68103-0_20

    Chapter  MATH  Google Scholar 

  5. Mitsikas, T., Almpani, S., Stefaneas, P., Frangos, P., Ouranos, I.: Formalizing air traffic control regulations in PSOA RuleML. In: Proceedings of the Doctoral Consortium and Challenge@ RuleML+ RR 2018 hosted by 2nd International Joint Conference on Rules and Reasoning, vol. 2204, CEUR Workshop Proceedings (2018)

    Google Scholar 

  6. Deryck, M., et al.: Aligning, interoperating, and co-executing air traffic control rules across PSOA RuleML and IDP. In: Fodor, P., Montali, M., Calvanese, D., Roman, D. (eds.) RuleML+RR 2019. LNCS, vol. 11784, pp. 52–66. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-31095-0_4

    Chapter  Google Scholar 

  7. Boley, H., Zou, G.: Perspectival knowledge in PSOA RuleML: representation, model theory, and translation. CoRR abs/1712.02869, v3 (2019)

    Google Scholar 

  8. Boley, H.: The RuleML knowledge-interoperation hub. In: Alferes, J.J.J., Bertossi, L., Governatori, G., Fodor, P., Roman, D. (eds.) RuleML 2016. LNCS, vol. 9718, pp. 19–33. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42019-6_2

    Chapter  Google Scholar 

  9. ISO: ISO/IEC 13211–1:1995: Information technology – programming languages – prolog – part 1: general core (1995)

    Google Scholar 

  10. Basin, D.A., Constable, R.L.: Metalogical frameworks. In: Proceedings of the Second Annual Workshop on Logical Frameworks, Edinburgh, UK, June 1991

    Google Scholar 

  11. Pereira, F., Warren, D.H.D.: Definite clause grammars for language analysis - a survey of the formalism and a comparison with augmented transition networks. Artif. Intell. 13, 231–278 (1980)

    Article  MathSciNet  Google Scholar 

  12. Boley, H.: RIF RuleML Rosetta Ring: round-tripping the Dlex subset of Datalog RuleML and RIF-Core. In: Governatori, G., Hall, J., Paschke, A. (eds.) RuleML 2009. LNCS, vol. 5858, pp. 29–42. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04985-9_6

    Chapter  Google Scholar 

  13. Rendel, T., Ostermann, K.: Invertible syntax descriptions: unifying parsing and pretty printing. SIGPLAN Not. 45(11), 1–12 (2010)

    Article  Google Scholar 

  14. Duregård, J., Jansson, P.: Embedded parser generators. ACM SIGPLAN Not. 46(12), 107–117 (2011)

    Article  Google Scholar 

  15. Matsuda, K., Wang, M.: FliPpr: a prettier invertible printing system. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 101–120. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-37036-6_6

    Chapter  Google Scholar 

  16. Al Manir, M.S., Riazanov, A., Boley, H., Baker, C.J.O.: PSOA RuleML API: a tool for processing abstract and concrete syntaxes. In: Bikakis, A., Giurca, A. (eds.) RuleML 2012. LNCS, vol. 7438, pp. 280–288. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32689-9_23

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RuleML, Lethbridge, AB, Canada

    Mark Thom

  2. University of New Brunswick, Fredericton, NB, Canada

    Harold Boley

  3. National Technical University of Athens, Athens, Greece

    Theodoros Mitsikas

Authors
  1. Mark Thom
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Harold Boley
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Theodoros Mitsikas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Mark Thom , Harold Boley or Theodoros Mitsikas .

Editor information

Editors and Affiliations

  1. School of Computer Science and Informatics, Cardiff University, Cardiff, UK

    Víctor Gutiérrez-Basulto

  2. University of Economics, Prague, Prague, Czech Republic

    Tomáš Kliegr

  3. Norwegian University of Science and Technology, Gjøvik, Norway

    Ahmet Soylu

  4. Department Of Informatics, University of Oslo, Oslo, Norway

    Martin Giese

  5. SINTEF AS, Oslo, Norway

    Dumitru Roman

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

Thom, M., Boley, H., Mitsikas, T. (2020). Invertible Bidirectional Metalogical Translation Between Prolog and RuleML for Knowledge Representation and Querying. In: Gutiérrez-Basulto, V., Kliegr, T., Soylu, A., Giese, M., Roman, D. (eds) Rules and Reasoning. RuleML+RR 2020. Lecture Notes in Computer Science(), vol 12173. Springer, Cham. https://doi.org/10.1007/978-3-030-57977-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-57977-7_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-57976-0

  • Online ISBN: 978-3-030-57977-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation