Please use this identifier to cite or link to this item:
Title: A core method for the weak completion semantics with skeptical abduction
Authors: Holldobler, S.
Keywords: Computer circuits;Logic programming;Semantics;Network layers
Issue Date: 2018
Publisher: AI Access Foundation
Citation: Saldanha, E.-A.D., Holldobler, S., Kencana Ramli, C.D.P., Medinacelli, L.P. A core method for the weak completion semantics with skeptical abduction // Journal of Artificial Intelligence Research. - 2018. - Volume 63. - Pages 51-86
Series/Report no.: Journal of Artificial Intelligence Research
Abstract: The Weak Completion Semantics is a novel cognitive theory which has been successfully applied to the suppression task, the selection task, syllogistic reasoning, the belief bias effect, spatial reasoning as well as reasoning with conditionals. It is based on logic programming with skeptical abduction. Each program admits a least model under the three-valued Lukasiewicz logic, which can be computed as the least fixed point of an appropriate semantic operator. The semantic operator can be represented by a three-layer feed-forward network using the core method. Its least fixed point is the unique stable state of a recursive network which is obtained from the three-layer feed-forward core by mapping the activation of the output layer back to the input layer. The recursive network is embedded into a novel network to compute skeptical abduction. This paper presents a fully connectionist realization of the Weak Completion Semantics
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File Description SizeFormat 
scopusresults 517 .pdf
  Restricted Access
61.92 kBAdobe PDFView/Open
WoS 493 .pdf
  Restricted Access
75.19 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.