Search Results for author:
Found 4 papers, 0 papers with code
A Brief History of Updates of Answer-Set Programs
Over the last couple of decades, there has been a considerable effort devoted to the problem of updating logic programs under the stable model semantics (a. k. a.
Exception-Based Knowledge Updates
Then it proposes a generic scheme for specifying semantic rule update operators, based on the idea of viewing a program as the set of sets of RE-models of its rules; updates are performed by introducing additional interpretations - exceptions - to the sets of RE-models of rules in the original program.
On Strong and Default Negation in Logic Program Updates (Extended Version)
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.
The Rise and Fall of Semantic Rule Updates Based on SE-Models
We define a specific operator based on this theorem, examine its computational complexity and compare the behaviour of this operator with syntactic rule update semantics from the literature.
