eprintid: 1361362
rev_number: 24
eprint_status: archive
userid: 608
dir: disk0/01/36/13/62
datestamp: 2012-09-13 19:54:46
lastmod: 2015-07-21 00:08:36
status_changed: 2014-04-04 14:39:53
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: Osorio, M
creators_name: Pérez, JAN
creators_name: Arrazola, J
title: A logical approach to A-Prolog
ispublished: pub
divisions: F48
keywords: answer sets; A-prolog; stable semantics
note: This is an Elsevier Open Access article.
abstract: 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.
date: 2002-10
official_url: http://dx.doi.org/10.1016/S1571-0661(04)80554-1
vfaculties: VENG
oa_status: green
full_text_type: pub
language: eng
primo: open
primo_central: open_green
verified: verified_manual
elements_source: DBLP
elements_id: 437931
doi: 10.1016/S1571-0661(04)80554-1
language_elements: EN
lyricists_name: Navarro Perez, JA
lyricists_id: JANAV96
full_text_status: public
publication: Electronic Notes in Theoretical Computer Science
volume: 67
pagerange: 284 - 295
issn: 1571-0661
citation:        Osorio, M;    Pérez, JAN;    Arrazola, J;      (2002)    A logical approach to A-Prolog.                   Electronic Notes in Theoretical Computer Science , 67    284 - 295.    10.1016/S1571-0661(04)80554-1 <https://doi.org/10.1016/S1571-0661%2804%2980554-1>.       Green open access   
 
document_url: https://discovery.ucl.ac.uk/id/eprint/1361362/1/wollic02.pdf