On the Relation between Weak Completion Semantics and Answer Set Semantics release_6rxp6msgfnbvfealxlwfgeii6q

by Emmanuelle-Anna Dietz Saldanha, Jorge Fandinno

Released as a article .

2019  

Abstract

The Weak Completion Semantics (WCS) is a computational cognitive theory that has shown to be successful in modeling episodes of human reasoning. As the WCS is a recently developed logic programming approach, this paper investigates the correspondence of the WCS with respect to the well-established Answer Set Semantics (ASP). The underlying three-valued logic of both semantics is different and their models are evaluated with respect to different program transformations. We first illustrate these differences by the formal representation of some examples of a well-known psychological experiment, the suppression task. After that, we will provide a translation from logic programs understood under the WCS into logic programs understood under the ASP. In particular, we will show that logic programs under the WCS can be represented as logic programs under the ASP by means of a definition completion, where all defined atoms in a program must be false when their definitions are false.
In text/plain format

Archived Files and Locations

application/pdf  202.7 kB
file_xbmz6kvjdvg65oownpzhrilya4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2019-10-16
Version   v1
Language   en ?
arXiv  1910.07278v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 2d8f08f4-1d38-4ea0-ad65-6e48451a1715
API URL: JSON