A well-founded semantics with disjunction

Authors:
João Alcântara;Carlos Viegas Damásio;Luís Moniz Pereira
Affiliations:
Centro de Inteligência Artificial (CENTRIA), Departamento de Informática, Universidade Nova de Lisboa, Caparica, Portugal;Centro de Inteligência Artificial (CENTRIA), Departamento de Informática, Universidade Nova de Lisboa, Caparica, Portugal;Centro de Inteligência Artificial (CENTRIA), Departamento de Informática, Universidade Nova de Lisboa, Caparica, Portugal
Venue:
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Year:
2005

Citing 7
Cited 1

On the declarative semantics of deductive databases and logic programs

Foundations of deductive databases and logic programming
A fixpoint semantics for disjunctive logic programs

Journal of Logic Programming
Generalized well-founded semantics for logic programs

CADE-10 Proceedings of the tenth international conference on Automated deduction
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Foundations of disjunctive logic programming

Foundations of disjunctive logic programming
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
On Indefinite Databases and the Closed World Assumption

Proceedings of the 6th Conference on Automated Deduction

A purely model-theoretic semantics for disjunctive logic programs with negation

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we develop a new semantics for disjunctive logic programs, called Well-Founded Semantics with Disjunction (WFSd), by resorting to a fixed point-based operator. Coinciding with the Well-Founded Semantics (WFS) for normal logic programs, our semantics is uniquely defined for every disjunctive logic program. By exploring examples, we show WFSd does not agree with any other semantics we have studied, such as Brass and Dix's D−WFS, Przymusinski's Static, Baral et al's GDWFS, Wang's WFDS, and van Gelder et al's SWFS. Despite that, we ensure WFSd is strictly stronger than D−WFS by guaranteing WFSd allows the five, desirable, program transformations proposed by Brass and Dix: unfolding, elimination of tautologies and non-minimal rules, and positive and negative reduction.