Name
Abstract | ||
|---|---|---|
Existing semantics for answer-set program updates fall into two categories: either they consider only strong negation in heads of rules, or they primarily rely on default negation in heads of rules and optionally provide support for strong negation by means of a syntactic transformation. In this paper we pinpoint the limitations of both these approaches and argue that both types of negation should be first-class citizens in the context of updates. We identify principles that plausibly constrain their interaction but are not simultaneously satisfied by any existing rule update semantics. Then we extend one of the most advanced semantics with direct support for strong negation and show that it satisfies the outlined principles as well as a variety of other desirable properties. |
Year | Venue | Field |
|---|---|---|
2014 | CoRR | Logic program,Data mining,Negation,Computer science,Negation introduction,Negation as failure,Syntax,Semantics |
DocType | Volume | Citations |
Journal | abs/1404.6784 | 0 |
PageRank | References | Authors |
0.34 | 15 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Slota | 1 | 174 | 12.43 |
| Martin Baláz | 2 | 1 | 1.38 |
| João Alexandre Leite | 3 | 772 | 54.57 |