Several applications require reasoning over autonomously developed ontologies. Initially conceived to explicit the semantics of a certain domain, these ontologies become a powerfu...
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Agent systems that search the Semantic Web are seen as killer applications for description logic (DL) inference engines. The guiding examples for the Semantic Web involve informat...
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir