Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin

This article deals with the combination of ontologies and rules by means of existential rules and answer set programming. Existential rules have been proposed for representing ontological knowledge, specifically in the context of Ontology- Based Data Access. Furthermore Answer Set Programming (ASP)...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of mathematics and artificial intelligence Ročník 82; číslo 1-3; s. 3 - 41
Hlavní autoři: Baget, Jean-François, Garcia, Laurent, Garreau, Fabien, Lefèvre, Claire, Rocher, Swan, Stéphan, Igor
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cham Springer International Publishing 01.03.2018
Springer
Springer Nature B.V
Springer Verlag
Témata:
Algorithms
Artificial Intelligence
Complex Systems
Computer Science
Computers
Declarative programming
Formalism
Knowledge
Knowledge representation
Logic programming
Mathematical programming
Mathematics
Monotony
Ontology
Semantics
Services
Existential rules
68N17
68P15
Decidability
68T27
Answer set programming
68Q17
Ontologies
68T30
ISSN:1012-2443, 1573-7470
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This article deals with the combination of ontologies and rules by means of existential rules and answer set programming. Existential rules have been proposed for representing ontological knowledge, specifically in the context of Ontology- Based Data Access. Furthermore Answer Set Programming (ASP) is an appropriate formalism to represent various problems issued from Artificial Intelligence and arising when available information is incomplete. The combination of the two formalisms requires to extend existential rules with nonmonotonic negation and to extend ASP with existential variables. In this article, we present the syntax and semantics of Existential Non Monotonic Rules (ENM-rules) using skolemization which join together the two frameworks. We formalize its links with standard ASP. Moreover, since entailment with existential rules is undecidable, we present conditions that ensure the termination of a breadth-first forward chaining algorithm known as the chase and we discuss extension of these results in the nonmonotonic case.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1012-2443
1573-7470
DOI:10.1007/s10472-017-9563-9