Skip to main content

PSOA RuleML: Integrated Object-Relational Data and Rules

  • Chapter
  • First Online:
Reasoning Web. Web Logic Rules (Reasoning Web 2015)

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

Included in the following conference series:

Abstract

Object-relational combinations are reviewed with a focus on the integrated Positional-Slotted, Object-Applicative (PSOA) RuleML. PSOA RuleML permits a predicate application (atom) to be without or with an Object IDentifier (OID) – typed by the predicate as its class – and, orthogonally, the predicate’s arguments to be positional, slotted, or combined. This enables six uses of atoms, which are systematically developed employing examples in presentation syntaxes derived from RuleML/POSL and RIF-BLD, and visualized in Scratch Grailog. These atoms, asserted as facts, are retrieved by object-relational look-in queries. On top of such facts, PSOA rules and their inferential querying are explored, e.g. permitting F-logic-like frames derived from relational joins. A use case of bidirectional SQL-PSOA-SPARQL transformation (schema/ontology mapping) is shown. Objectification and the presentation plus (XML-)serialization syntaxes of PSOA RuleML are described. The first-order model-theoretic semantics is formalized, blending (OID-over-)slot distribution, as in RIF, with integrated psoa terms, as in RuleML. The PSOATransRun implementation is surveyed, translating PSOA RuleML to TPTP (PSOA2TPTP) or Prolog (PSOA2Prolog).

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    http://en.wikipedia.org/wiki/Linked_open_data.

  2. 2.

    http://wiki.ruleml.org/index.php/PSOA_RuleML.

  3. 3.

    With ‘object-centered’ rather than ‘object-oriented’ atoms we refer to atoms that have a typed OID described by slots and/or positional arguments. Object-Oriented Programming (OOP) usually only employs descriptive slots but not positional arguments; on the other hand, OOP allows the re-assignment of slot fillers (instance variables) while object-centered modeling – as its declarative core – only allows the refinement of non-ground slot fillers and – in PSOA RuleML – positional arguments.

  4. 4.

    We use the upper-cased “PSOA” as a qualifier for the language and the lower-cased “psoa” for its terms.

  5. 5.

    http://wiki.ruleml.org/index.php/Grailog#Family_Example.

  6. 6.

    http://www.w3.org/TR/rif-bld/#Terms.

  7. 7.

    http://www.cs.unb.ca/~boley/papers/MusicAlbumKB.txt.

  8. 8.

    http://wiki.ruleml.org/index.php/Geospatial_Rules.

  9. 9.

    http://wiki.ruleml.org/index.php/RuleML_in_JSON.

  10. 10.

    http://wiki.ruleml.org/index.php/Grailog.

  11. 11.

    The usual “stick figures” for directed graphs – connecting pairs of nodes with arrows – are generalized to “skewer figures” for directed hypergraphs – each (bendable) skewer holding arbitrarily many nodes together in a totally ordered fashion.

  12. 12.

    A labelnode can be used as a label (relation) or as a node (argument).

  13. 13.

    In the following, “hyperarc” will be used as an abbreviation for “directed hyperarc”.

  14. 14.

    Branch lines permit multiple attachment points for visualizing multiple tuples [3], exemplified below, as well as (multiple) slots, to be introduced in Sect. 2.3.

  15. 15.

    The POsitional-SLotted language started integrating positional and slotted syntaxes: http://ruleml.org/submission/ruleml-shortation.html.

  16. 16.

    This is partly due to the RIF-like Presentation syntax used here being somewhat simplified w.r.t. the one used by PSOA RuleML tools: in particular, the “_” prefix is omitted from local constants, except for system-generated ones.

  17. 17.

    For the infrequent case of n = 0, not needed in this paper, hyperarcs (‘connecting’ one labelnode) degenerate to an outgoing arrow head attached to the relation labelnode or branch line.

  18. 18.

    Such merging of tuples – and (later) slots – centered on the same OID is called ‘centralization’. It constructs one object-identified psoa term from a given set of equally identified psoa terms. Centralization will be assumed when illustrating the proof-theoretic semantics in Sects. 3 and 4. It is the inverse of tupribution – and slotribution – to be introduced in Sect. 7. Harvesting the set of all psoa terms with a fixed OID from a distributed network – e.g. published on the Web – can use techniques analogous to finding all RDF triples having a fixed resource as their subject (cf. http://www.w3.org/wiki/TaskForces/CommunityProjects/LinkingOpenData/SemanticWebSearchEngines). This is a non-trivial task, since such OIDs and resources normally are not dereferenceable locators themselves but occur within documents at other locators (although, ideally, those documents have filename extensions like .ruleml and .rdf, respectively).

  19. 19.

    In RIF called “named-argument terms” [2].

  20. 20.

    The figure’s representation of dimension = 2 indicates that this betweenness is relative to a 2D plane (rather than, say, to a 3D sphere).

  21. 21.

    As usual in Logic Programming, a non-ground query is understood to have existential quantification for all free variables. For basic LP terminology and notions see [13].

  22. 22.

    Betweenness with dimension = 2 for geographical entities assumes some projection of the globe to a 2D coordinate system.

  23. 23.

    http://www.jdrew.org/oojdrew/.

  24. 24.

    Earlier (flat and nested) positional versions have been used to explain XML-to-XML transformation (http://www.cs.unb.ca/~boley/cs6795swt/cs6795swt-XML.pdf). Later, a similar use case was employed to demonstrate SPINMap for RDF-to-RDF transformation [15].

  25. 25.

    Alternatively, given column headings like Name, Street, and Town, the input conversion for PSOA could skip the relationship addressRel("Seminaris" "Wikingerufer 7" "14195 Berlin"), but generate a pairship addressRel(name->"Seminaris" street->"Wikingerufer 7" town->"14195 Berlin"), already closer to the level of frames and SPARQL.

  26. 26.

    The “lift” and “drop” terminology for conversions at the input and output interfaces has been introduced in http://yosemiteproject.org, and is related to the “lifting” and “lowering” terminology of http://www.w3.org/TR/sawsdl/#schemaMapping.

  27. 27.

    For an example-based introduction to the basic tags of Deliberation RuleML see http://ruleml.org/papers/Primer.

  28. 28.

    http://wiki.ruleml.org/index.php/PSOA_RuleML#Implementation.

  29. 29.

    TPTP-FOF is also targeted by http://wiki.ruleml.org/index.php/TPTP_RuleML.

  30. 30.

    http://www.antlr.org.

  31. 31.

    https://github.com/sadnanalmanir/PSOARuleML-API.

  32. 32.

    http://psoa2tptp.googlecode.com.

  33. 33.

    http://riazanov.webs.com/software.htm.

  34. 34.

    http://psoa-ruleml.rhcloud.com.

  35. 35.

    http://psoa.ruleml.org/transrun/0.7/local/.

  36. 36.

    http://interprolog.com.

  37. 37.

    http://xsb.sourceforge.net.

References

  1. Kifer, M., Lausen, G., Wu, J.: Logical foundations of object-oriented and frame-based languages. J. ACM 42(4), 741–843 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Boley, H., Kifer, M.: RIF Basic Logic Dialect (2nd edn), February 2013 W3C Recommendation. http://www.w3.org/TR/rif-bld

  3. Boley, H.: A RIF-Style Semantics for RuleML-Integrated Positional-Slotted, Object-Applicative Rules. In: Bassiliades, N., Governatori, G., Paschke, A. (eds.) RuleML 2011 - Europe. LNCS, vol. 6826, pp. 194–211. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Boley, H.: Grailog 1.0: Graph-Logic Visualization of Ontologies and Rules. In: Morgenstern, L., Stefaneas, P., Lévy, F., Wyner, A., Paschke, A. (eds.) RuleML 2013. LNCS, vol. 8035, pp. 52–67. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Athan, T., Boley, H.: The MYNG 1.01 Suite for Deliberation RuleML 1.01: Taming the Language Lattice. In: Patkos, T., Wyner, A., Giurca, A., (eds.). Proceedings of the RuleML 2014 Challenge, at the 8th International Web Rule Symposium, Prague, Czech Republic, Volume 1211 of CEUR, August 2014

    Google Scholar 

  6. Hanus (ed.), M.: Curry: An Integrated Functional Logic Language (Vers. 0.8.3). http://www-ps.informatik.uni-kiel.de/currywiki/_media/documentation/report.pdf (February 2014)

  7. Agarwal, S., Mohapatra, P., Genesereth, M., Boley, H.: Rule-based exploration of structured data in the browser. In: Bassiliades, N., et al. (eds.) RuleML 2015. LNCS, vol. 9202, pp. 161–175. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  8. Berners-Lee, T., Connolly, D., Kagal, L., Scharf, Y., Hendler, J.: N3Logic: a logical framework for the world wide web. Theor. Pract. Logic Program. (TPLP) 8(3), 249–269 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Riazanov, A., Rose, G.W., Klein, A., Forster, A.J., Baker, C.J.O., Shaban-Nejad, A., Buckeridge, D.L.: Towards clinical intelligence with SADI semantic web services: a case study with hospital-acquired infections data. In: Proceedings of the 4th International Workshop on Semantic Web Applications and Tools for the Life Sciences, SWAT4LS 2011, pp. 106–113. ACM New York (2012)

    Google Scholar 

  10. Zou, G.: GeospatialRules: A Datalog+ RuleML Rulebase for Geospatial Reasoning. In: Patkos, T., Wyner, A., Giurca, A. (eds.) Challenge+DC@RuleML. Volume 1211 of CEUR Workshop Proceedings., CEUR-WS.org (2014)

    Google Scholar 

  11. Crockford, D.: Introducing JSON (May 2009) Format home page. http://json.org

  12. Boley, H.: Integrating positional and slotted knowledge on the semantic web. J. Emerg. Technol. Web Intell. 4(2), 343–353 (2010)

    Google Scholar 

  13. Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, New York (1987)

    Book  MATH  Google Scholar 

  14. Ball, M., Boley, H., Hirtle, D., Mei, J., Spencer, B.: The OO jDREW reference implementation of RuleML. In: Adi, A., Stoutenburg, S., Tabet, S. (eds.) RuleML 2005. LNCS, vol. 3791, pp. 218–223. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Knublauch, H.: SPINMap: SPARQL-based Ontology Mapping with a Graphical Notation (April 2011) Composing the Semantic Web: A tool developer’s blog on ontology development for the Semantic Web and beyond, http://composing-the-semantic-web.blogspot.ca/2011/04/spinmap-sparql-based-ontology-mapping.html

  16. Brunnbauer, M.: RDF2RDB - convert RDF data to relational databases (2012). http://www.netestate.de/en/software-development/rdf2rdb/

  17. Das, S., Sundara, S., Cyganiak, R.: R2RML: RDB to RDF mapping language. World Wide Web Consortium, Recommendation REC-r2rml-20120927 (September 2012)

    Google Scholar 

  18. Yang, G., Kifer, M.: Reasoning about Anonymous Resources and Meta Statements. In: Spaccapietra, Stefano, March, Sal, Aberer, Karl (eds.) Journal on Data Semantics I. LNCS, vol. 2800, pp. 69–97. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  19. Zou, G., Peter-Paul, R., Boley, H., Riazanov, A.: PSOA2TPTP: a reference translator for interoperating PSOA RuleML with TPTP reasoners. In: Bikakis, A., Giurca, A. (eds.) RuleML 2012. LNCS, vol. 7438, pp. 264–279. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  20. Zou, G., Boley, H.: PSOA2Prolog: object-relational rule interoperation and implementation by translation from PSOA RuleML to ISO prolog. In: Bassiliades, N., et al. (eds.) Rule Technologies: Foundations, Tools, and Applications. LNCS, vol. 9202, pp. 176–192. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  21. Sutcliffe, G.: The TPTP problem library and associated infrastructure. J. Autom. Reasoning 43(4), 337–362 (2009)

    Article  MATH  Google Scholar 

  22. ISO/IEC 13211-1: Prolog - part 1: General core (1995)

    Google Scholar 

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

    Chapter  Google Scholar 

Download references

Acknowledgements

Many thanks go to Gen Zou for helpful discussions on multiple drafts of this paper and for spearheading the PSOATransRun implementation. I want to thank Tara Athan, Sadnan Al Manir, Alexandre Riazanov, and Robert Kirby for reviewing earlier partial versions. I extend my thanks to Michael Genesereth, Sudhir Agarwal, Abhijeet Mohapatra, and Eric Kao for comments on a PSOA RuleML presentation in the Computational Logic Seminar, and to Michael Genesereth and the entire Stanford Logic Group for hosting my research stay. My thankfulness goes to Richard Waldinger for comments at various occasions, and for hosting my recent SRI visits. The 11th Reasoning Web Summer School (RW 2015) reviewer and organizers are thanked for early feedback and for running this event. NSERC is thanked for its support through Discovery Grants.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Harold Boley .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Boley, H. (2015). PSOA RuleML: Integrated Object-Relational Data and Rules. In: Faber, W., Paschke, A. (eds) Reasoning Web. Web Logic Rules. Reasoning Web 2015. Lecture Notes in Computer Science(), vol 9203. Springer, Cham. https://doi.org/10.1007/978-3-319-21768-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21768-0_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21767-3

  • Online ISBN: 978-3-319-21768-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics