Open answer set programming for the semantic web

We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guarding knowledge representation mechanisms such as negation as failure and inequalities. Reasoning with the resulting extended forest logic programs (EFoLPs) can be reduced to finite answer set programming, for which reasoners are available. We argue that extended forest logic programming is a useful tool for uniformly representing and reasoning with both ontological and rule-based knowledge, as they can capture a large fragment of the OWL DL ontology language equipped with DL-safe rules. Furthermore, EFoLPs enable nonmonotonic reasoning, a desirable feature in locally closed subareas of the Semantic Web. Key words: Answer Set Programming, Semantic Web, Description Logics, Open Domain Reasoning

• Type: Journal
• Year: 2007
• Where: JAPLL
• Authors: Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
• Keywords: Answer Set Programming, Extended Forest Logic, JAPLL 2007, Reasoning