Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657788 | Theoretical Computer Science | 2005 | 31 Pages |
Abstract
The topic of this paper is to allow any assignment (i.e. interpretation), over a truth space, to be a default assumption. Our main result is that our extension is conservative in the sense that under the “everywhere false” default assumption (CWA) the usual stable model semantics is captured. Due to the generality and the purely algebraic nature of our approach, it abstracts from the particular formalism of choice and the results may be applied in other contexts as well.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Yann Loyer, Umberto Straccia,