๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Paraconsistent Declarative Semantics for Extended Logic Programs

โœ Scribed by Ofer Arieli

Book ID
110347709
Publisher
Springer Netherlands
Year
2002
Tongue
English
Weight
264 KB
Volume
36
Category
Article
ISSN
1012-2443

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A declarative semantics for depth-first
A declarative semantics for depth-first logic programs
โœ Birgit Elbl ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 438 KB

Depth-ยฎrst evaluation causes a gap between the result of the computation and the classical declarative semantics for logic programs. The paper presents a new semantics for logic programs closing that gap. Although not classical, this semantics, called biquantale semantics, is declarative, since it i

An encompassing framework for Paraconsis
An encompassing framework for Paraconsistent Logic Programs
โœ Joรฃo Alcรขntara; Carlos Viegas Damรกsio; Luรญs Moniz Pereira ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 280 KB

We propose a framework which extends Antitonic Logic Programs [Damรกsio and Pereira, in: Proc. 6th Int. Conf. on Logic Programming and Nonmonotonic Reasoning, Springer, 2001, p. 748] to an arbitrary complete bilattice of truth-values, where belief and doubt are explicitly represented. Inspired by Gin

A kripke-kleene semantics for logic prog
A kripke-kleene semantics for logic programs*
โœ Melvin Fitting ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 895 KB

We use a language L in which we have the propositional connectives A (and), V (or), and -i (not) as primitive. Alternatively we could take some as primitive and define others via the usual definitions, which work even in Kleene's three-valued logic. We also allow quantifiers V and 3, taking both as