From International Center for Computational Logic
Existential Rules are a knowledge representation formalism used in artificial intelligence and database theory. Their syntactic flexibility enables an easy integration of both semantic knowledge and databases. Syntactically close to Datalog rules, an important distinguishing feature is the possibility to describe individuals whose existence was not originally known, which is of great help for modeling purposes. All these features have motivated an intense research effort on how to query data under such rules. Questions typically tackled with this respect are the following: which query language achieve a good tradeoff between expressivity and complexity? What ensures the decidability of the query answering problem? What is the complexity of specific classes of rules? How to build efficient reasoners?
Professors and Research Group Leaders
Talks and Miscellaneous
Data Integration and Access by Merging Ontologies and Databases
A Grand Unified Theory of Decidability in Logic-Based Knowledge Representation
A fast, highly scalable rule engine for existential rules and Datalog.