✦ LIBER ✦

Open answer set programming for the semantic web

✍ Scribed by Stijn Heymans; Davy Van Nieuwenborgh; Dirk Vermeir

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 378 KB
Volume: 5
Category: Article
ISSN: 1570-8683
DOI: 10.1016/j.jal.2006.02.001

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Explaining answers from the Semantic Web

Explaining answers from the Semantic Web: the Inference Web approach

✍ Deborah L. McGuinness; Paulo Pinheiro da Silva 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 491 KB

The Semantic Web lacks support for explaining answers from web applications. When applications return answers, many users do not know what information sources were used, when they were updated, how reliable the source was, or what information was looked up versus derived. Many users also do not know

Text summarization contribution to seman

Text summarization contribution to semantic question answering: New approaches for finding answers on the web

✍ Elena Lloret; Hector Llorens; Paloma Moreda; Estela Saquete; Manuel Palomar 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 400 KB

As the Internet grows, it becomes essential to find efficient tools to deal with all the available information. Question answering (QA) and text summarization (TS) research fields focus on presenting the information requested by users in a more concise way. In this paper, the appropriateness and ben

OWL-QL—a language for deductive query an

OWL-QL—a language for deductive query answering on the Semantic Web

✍ Richard Fikes; Patrick Hayes; Ian Horrocks 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 120 KB

This paper discusses the issues involved in designing a query language for the Semantic Web and presents the OWL query language (OWL-QL) as a candidate standard language and protocol for query-answering dialogues among Semantic Web computational agents using knowledge represented in the W3Cs ontolog

Preferred answer sets for extended logic

Preferred answer sets for extended logic programs

✍ Gerhard Brewka; Thomas Eiter 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 442 KB

In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs. In such programs an ordering on the program rules is used to express preferences. We show how this ordering can be used to defi

Ontologies and the Semantic Web

✍ Elin K. Jacob 📂 Article 📅 2005 🏛 American Society for Information Science and Techn 🌐 English ⚖ 96 KB

The Semantic Web: More than a Vision

✍ Jane Greenberg 📂 Article 📅 2005 🏛 American Society for Information Science and Techn 🌐 English ⚖ 68 KB 👁 2 views

## Special Section O ur dependence on World Wide Web (Web) technology for information, communication and services grows daily. Consider the slightly frantic behaviors people often exhibit when they are unable to access the Web for an extended period of time. Of course there is the other side -a br