A logical approach to A-Prolog.
Electronic Notes in Theoretical Computer Science
284 - 295.
It has been recently provided a characterization of Answer Sets by intuitionistic logic as follows: a literal is entailed by a program in the stable model semantics if and only if it belongs to every intuitionistically complete and consistent extension of the program formed by adding only negated literals. We show that if we replace intuitionistic logic by any si-logic the result still holds.
|Title:||A logical approach to A-Prolog|
|Open access status:||An open access version is available from UCL Discovery|
|Additional information:||This is an Elsevier Open Access article.|
|Keywords:||answer sets; A-prolog; stable semantics|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only