Abstract

QuLog is a higher-order logic/functional/string processing language with an imperative rule language sitting on top, defining actions. QuLog’s action rules are used to program multi-threaded communicating agent behaviour. Its declarative subset is used for the agent’s belief store. The language is flexibly typed and allows a combination of compile time and run-time type checking.

It is a fully integrated in that function calls can appear as or inside arguments to relation calls, and relational queries can be used as guards of function rules. It has sets as a separate data type from lists with set <-> list convertors. Both can be created using Trm::Query comprehension expressions.

Sets are manipulated using union, intersection and difference operators. Lists are manipulated as in Prolog but also using non-deterministic pattern matching. Similar pattern matching is used for string processing as a precursor to DCG parsing. An in primitive can be used to access elements of sets, lists and characters in strings.

It supports type safe meta-level programming to complement its type safe higher order programming.

It is the implementation and belief store language of our multi-threaded TeleoR agent architecture.

The talk will step by step introduce and also exemplify the key features of QuLog using its interpreter.

[Joint work with Peter Robinson, U of Queensland]