Jump to content

Rulelog

Add links
From Wikipedia, the free encyclopedia

Rulelog[1][2][3] is an expressive semantic rule-based knowledge representation and reasoning (KRR) language. It underlies knowledge representation languages used in systems such as Flora-2, SILK[4] and others. It extends well-founded declarative logic programs with features for higher-order syntax, frame syntax, defeasibility, general quantified expressions both in the bodies of the rules and their heads, user-defined functions, and restraint bounded rationality.

Features

[edit]

Rulelog extends well-founded semantics for declarative logic rules with features for higher-order syntax (HiLog), frame syntax (cf. F-Logic), defeasibility (prioritized defaults[5][6]), general formulas (including existentials and disjunctions in rule heads), user-defined functions, and restraint bounded rationality.[7] Overall, Rulelog combines deep logical/probabilistic reasoning with natural language processing (NLP), and complements machine learning (ML). Rulelog interoperates and composes well with graph databases, relational databases, spreadsheets, XML, RDF/OWL, and can orchestrate overall hybrid KRR. Despite its expressibility, Rulelog is computationally affordable (inferencing is worst-case polynomial time when radial restraint is employed). The more capable and efficient implementations of Rulelog, such as Ergo, Flora-2, and Ontobroker leverage methods from Logic programming, Non-monotonic reasoning, Business rules, the Semantic Web, and Databases. Rulelog implementation methods (in systems like Ergo, Flora-2 and some others) include dependency-aware smart caching of reasoning results (memoization, also known as tabling in logic programming), indexing, and goal reordering (for improving the performance of joins).

History

[edit]

Rulelog builds on decades of work in Logic Programming and Deductive database research; it combines several different extensions of declarative logic programs whose language and implementations were originally developed by a number of different researchers since 1990's. Many of Rulelog's features derive from earlier systems, including Flora-2, SweetRules,[8] XSB,[9] SWSL,[10][11] and others.

Standardization Efforts

[edit]

There was a number of standardization efforts for precursors of Rulelog:

Systems Implementing Rulelog

[edit]
  • Flora-2: an open source rule-based system for knowledge representation and reasoning.
  • ErgoAI: an implementation of Rulelog by Coherent Knowledge, which includes an IDE and many extensions. This was originally commercial, but has now been available open source (Apache license).
  • Sunflower: an integrated development environment for Flora-2.
  • SILK:[4] a precursor to Ergo.
  • Ontobroker: a commercial implementation of a subset of Rulelog, which is largely based on F-logic with various extensions.
  • XSB: supports a smaller subset of Rulelog's features, but a number of other systems, like Flora-2 and Ergo, are based on XSB. Open source.

See also

[edit]

References

[edit]
  1. ^ Grosof B.N. (2013) Rapid Text-Based Authoring of Defeasible Higher-Order Logic Formulas, via Textual Logic and Rulelog. In: Morgenstern L., Stefaneas P., Levy F., Wyner A., Paschke A. (eds) Theory, Practice, and Applications of Rules on the Web. RuleML 2013. Lecture Notes in Computer Science, vol 8035. Springer, Berlin, Heidelberg
  2. ^ Grosof, B. and Kifer, M. (2013) Rulelog: Syntax and Semantics Archived 2018-12-19 at the Wayback Machine
  3. ^ Benjamin Grosof, Michael Kifer, and Paul Fodor (2017). Rulelog: Highly Expressive Rules with Deep Scalable Reasoning. Tutorial presented at the International Joint Conference on Rules and Reasoning (RuleML+RR-2017) in London, UK, July 13, 2017.
  4. ^ a b Carl Andersen, Brett Benyo, Miguel Calejo, Mike Dean, Paul Fodor, Benjamin N. Grosof, Michael Kifer, Senlin Liang, Terrance Swift (2013). Understanding Rulelog Computations in Silk. Proceedings of the 23rd Workshop on Logic-based methods in Programming Environments (WLPE 2013).
  5. ^ Wan H., Grosof B., Kifer M., Fodor P., Liang S. (2009) Logic Programming with Defaults and Argumentation Theories. In: Hill P.M., Warren D.S. (eds) Logic Programming. ICLP 2009. Lecture Notes in Computer Science, vol 5649. Springer, Berlin, Heidelberg
  6. ^ Hui Wan, Michael Kifer, Benjamin Grosof, Defeasibility in answer set programs via argumentation theories, Proceedings of the Fourth international conference on Web reasoning and rule systems, September 22–24, 2010, Bressanone, Italy
  7. ^ Grosof, B. and Swift, T. (2013) Radial Restraint: A Semantically Clean Approach to Bounded Rationality for Logic Programs, Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence July 14–18, 2013, Bellevue, Washington, USA
  8. ^ B. Grosof, M. Dean, S. Ganjugunte, S. Tabet, and C. Neogy (2005). SweetRules: An open source platform for semantic web business rules. Web site.
  9. ^ Terrance Swift and David s. Warren. 2012. Xsb: Extending prolog with tabled logic programming. Theory Pract. Log. Program. 12, 1-2 (January 2012), 157-187. doi:10.1017/S1471068411000500
  10. ^ S. Battle, A. Bernstein, H. Boley, B. Grosof, M. Gruninger, R. Hull, M. Kifer, D. Martin, S. McIlraith, D. McGuinness, J. Su, and S. Tabet (2005) Semantic Web Services Framework (SWSF) Overview. Member Submission
  11. ^ S. Battle, A. Bernstein, H. Boley, B. Grosof, M. Gruninger, R. Hull, M. Kifer, D. Martin, S. McIlraith, D. McGuinness, J. Su, and S. Tabet (2005). SWSL: Semantic Web Services Language. Member Submission, W3C, April 2005.
  12. ^ S. Battle, A. Bernstein, H. Boley, B. Grosof, M. Gruninger, R. Hull, M. Kifer, D. Martin, S. McIlraith, D. McGuinness, J. Su, and S. Tabet (2005). SWSL: Semantic Web Services Language. Technical report, W3C, April 2005.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Rulelog&oldid=1253360886"