Call for Papers and Demos for the 11th International Rule Challenge

The RuleML+RR 2017 Challenge is one of the highlights of the conference, and seeks to provide competition among innovative rule-oriented applications, aimed at both the research and industrial side. Submissions may present demos related to the RuleML+RR 2017 track topics, supply benchmarks and comparison results for rule engines, illustrate rule- and model-driven engineering, report on industrial experience, present real cases and practical experiences, and realize mobile deployment of rule-based reasoning.


The challenge seeks high quality, original papers, potentially referencing online material, and ranging between 5-15 pages. Papers must be original contributions written in English and will be submitted at

To ensure high quality, submitted papers will be carefully peer-reviewed by 3 PC members based on clarity and significance of objectives and demonstration of results.

Each paper shall address the following:

  • Explain the objectives, outcomes, benefits as you are going beyond the state of the art in technology, the application domain, etc.
  • Prove the results with a concrete example balancing conciseness and completeness
  • Preferably (but not necessarily) embed the tool in a web-based or distributed environment or a mobile environment
  • Present end-user interactions, providing an adequate and usable interface that favours a concrete usage of the application
  • Mention the availability of the software and data, data interchange, and possible tool extensions
  • If it is the case, provide a web-link to the project site, online demonstration, or download site

Please upload all submissions in LNCS format. Rule Challenge 2017 proceedings will be published as CEUR Proceedings and indexed by SCOPUS.

The best paper/demonstration in the Challenge will receive the RuleML Challenge Award (USD 500)!


Rule Challenge Important Dates

Abstract1st May 2017
Paper submission8th May 2017
Notification15th May 2017
Camera-ready22nd May 2017


Invited demo

Concurrent Multi-tasking Robotic Agent Programming in TeleoR

Keith L. Clark, Imperial College London, UK

TeleoR is a major extension of Nilsson’s Teleo-Reactive (TR) rule based robotic agent programming language. Programs comprise sequences of Guard ~> Action rules grouped into parameterised procedures. The guards are deductive queries to a set of rapidly changing percept facts in the agent’s Belief Store. The actions are either sets of primitive actions for external robotic resources, to be executed in parallel, or a single call to a procedure, which can be a recursive call. The primitive actions are usually durative and are stopped or modified only when another action is determined. In each invoked procedure the first rule with an inferable guard is fired.

The guard of the first rule of a procedure is the procedure’s goal. The other guards form a sub-goal tree rooted at this guard. Their linked actions are such that when the rule is fired the action will normally eventually result in an earlier rule being fired. If there is always a rule that can be fired, the procedure is a universal action plan for achieving its goal. The goal of a task is the goal of the initially called procedure.

A TR and TeleoR computation is also highly reactive in that on each Belief Store update rule firings are reconsidered, starting with the initially called procedure. If in some called procedure a higher rule can be fired, progress has been made towards the task goal perhaps due to outside help. If instead a lower rule is fired, exogenous events or action failure has resulted in a setback. The lower rule has been fired in order to try to climb back up the procedure’s, and hence the task’s, sub-goal tree. This operational semantics results in both robust and opportunistic behaviour, well suited to robot/robot and robot/human collaboration.

TeleoR extends TR in being typed and higher order, with extra forms of rules that allow finer control over sub-goal achieving task behaviour. Its most important extension is the concept of task atomic procedures. These enable the high level programming of multi-tasking agents that interleave the use of one or more independent robotic resources, without interference, deadlock or task starvation.

TeleoR multi-task programming is illustrated by a program that can be used by an agent controlling two robotic arms in multiple block tower assembly tasks, chosen as a representative of robotic assembly or packing tasks. Both arms need to be shared by the tasks, and the arms execute in parallel whenever possible.


Sample domains

Rules in Retail

  • When a customer enters the store and an “offer of the day” is available, then push only one welcome notification and display the offer.
  • When a customer watches a specific product, then push related photos and information, including social media reactions, directly to their device.
Rules in Tourism

  • Deliver a welcome message to POI visitors as they arrive nearby.
  • When a visitor leaves a room in the museum, then push notifications regarding the next recommended room, based on visitors’ preferences and previous visit history.
  • When a visitor completes the tour, then push goodbye messages and notify on upcoming/partner exhibitions.
Rules in Transportation

  • When arriving at car parking, then push a notification on available places.
  • When selecting destination and inside a bus station, then display bus data (arrival time, notices).
  • When bus nears destination, then push notification on time to arrival and suggest accommodations.
Rules in Geography

  • A region X is part of a region Y if and only if all regions that connect to X also connect to Y.
  • Two regions X and Y are overlapped if and only if there exists a region Z such that Z is part of X and Z is part of Y.
Rules in Location-Based Search

  • If less than or equal to k POIs of type X (e.g., Restaurants) are found, then zoom in/out on the map to the axis-aligned minimum bounding box of all POIs.
  • If more than k POIs of type X are found, then zoom in/out on the map to the axis-aligned minimum bounding box of the k-nearest POIs.
  • If the POIs searched for are of type X then suggest to the user subtypes of X (e.g., Italian, Greek) for a subsequent (i.e., refined) search.
Rules in Insurance Regulation

  • If an item is perishable and is delivered more than 10 days after the scheduled delivery date, then it may be rejected.
  • Each tax schedule must have electronic signatures from two managers.
  • If an inspector believes a vehicle is repairable then process the claim as a repair; otherwise process the claim as a total loss.
Rules in Medicine

  • If a Type II diabetes patient’s current level of HbA1c is high, then the patient’s current treatment is ineffective.
  • Issue medical alerts to patients (e.g., on a mobile device), based on health trend analysis and personalizable health value limits.
  • If patient has low back pain without radicular pain or neurologic findings, then consider urine drug screening and repeat neurologic test.
Rules in Ecosystem Research

  • If a plot in a monitoring network satisfies a number of prespecified requirements, such as being a long distance off from any other plot, then it is eligible for statistical analysis.
  • If the percentage of a target species on a plot exceeds a certain threshold, then the plot is treated differently in statistical analysis than plots where the target species is less abundant.
  • The percentage of a target species on a plot must not vary throughout the analysis.
?Your domain!

Past Challenge editions

2016: Stony Brook New York (, CEUR-WS Vol. 1620),
2015: Berlin, Germany (, CEUR-WS Vol. 1417 ),
2014: Prague, Czeck Republic (, CEUR-WS Vol. 1211 ),
2013: Seattle, USA (, CEUR-WS Vol. 1004),
2012: Montpellier, France (, CEUR-WS Vol. 874 ),
2011: Ft Lauderdale, Florida (, CEUR-WS Vol. 799),
2010: Washington, DC (, CEUR-WS Vol. 649),
2009: Las Vegas, Nevada (,
2008: Orlando, Florida (,
2007: Orlando, Florida (