Scenario semantics of extended logic programs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a coherent, fexible, unifying, and intuitive framework for the
study of explicit negation in logic programs, based on the notion of admissible scenaria and the "coherence principle". With this support we introduce,
in a simple way, a proposed "ideal sceptical semantics", as well as its well{
founded counterpart.
Another result is a less sceptical "complete scenaria semantics", and its
proof of equivalence to the well{founded semantics with explicit negation
(WFSX). This has the added benect of bridging complete scenaria to default theory via WFSX, dened here based on Gelfond{Lifschitz operator..
Finally, we characterize a variety of more and less sceptical or credulous
semantics, including answer{sets, and give sucient conditions for equivalence between those semantics.
Original languageEnglish
Title of host publicationMIT Press
Pages334-348
ISBN (Electronic)0-262-66083-0
Publication statusPublished - 1 Jan 1993
EventLOGIC PROGRAMMING AND NON-MONOTONIC REASONING -
Duration: 1 Jan 1993 → …

Conference

ConferenceLOGIC PROGRAMMING AND NON-MONOTONIC REASONING
Period1/01/93 → …

Fingerprint Dive into the research topics of 'Scenario semantics of extended logic programs'. Together they form a unique fingerprint.

  • Cite this

    Alferes, J. J. A., Pereira, L. M., & Dung, P. M. (1993). Scenario semantics of extended logic programs. In MIT Press (pp. 334-348)