Simpli ed reduct for choice rules in ASP
File(s)DTR15-2.pdf (239.64 KB)
Published version
Author(s)
Russo, Alessandra
Type
Report
Abstract
The accepted de nitions of the semantics of choice rules in Answer Set Programming (ASP) involve a translation
by inventing new atoms which do not occur in the original program. In this report, we put forward a new
de nition of the reduct for programs containing choice rules which does not invent new predicates and prove that
the semantics are the same for the subset of ASP which we consider.
by inventing new atoms which do not occur in the original program. In this report, we put forward a new
de nition of the reduct for programs containing choice rules which does not invent new predicates and prove that
the semantics are the same for the subset of ASP which we consider.
Date Issued
2015-01-01
Citation
Departmental Technical Report: 15/2, 2015, pp.1-10
Publisher
Department of Computing, Imperial College London
Start Page
1
End Page
10
Journal / Book Title
Departmental Technical Report: 15/2
Copyright Statement
© 2015 The Author(s). This report is available open access under a CC-BY-NC-ND (https://creativecommons.org/licenses/by-nc-nd/4.0/)
Publication Status
Published
Article Number
15/2