FO(ID) as an Extension of DL with Rules

author: Joost Vennekens, Department of Computer Science, KU Leuven
published: July 28, 2009,   recorded: June 2009,   views: 43
Categories

Slides

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

There are many interesting Knowledge Representation questions surrounding rule languages for the Semantic Web. The most basic one is of course: which kind of rules should be used and how do they integrate with existing Description Logics? Similar questions have already been adressed in the field of Logic Programming, where one particular answer has been provided by the language of FO(ID). FO(ID) is an extension of classical first-order logic with a rule-based representation for inductive defintions. By offering a general integration of first-order logic and Logic Programs, it also induces a particular way of extending Description Logics with rules. The goal of this paper is to investigate this integration and discover whether there are interesting extensions of DL with rules that can be arrived at by imposing appropriate restrictions on the highly expressive FO(ID).

See Also:

Download slides icon Download slides: eswc09_vennekens_faaeod_01.pdf (157.5┬áKB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: