Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA

DOI10.1023/A:1005952908693zbMath0893.68026MaRDI QIDQ1382158

Jürgen Dix, Stefan Brass

Publication date: 3 August 1998

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

disjunctive logic programssemantics D-WFS

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (11)

Backdoors to Normality for Disjunctive Logic Programs ⋮ The infinite-valued semantics: overview, recent results and future directions ⋮ Partial equilibrium logic ⋮ Heterogeneous active agents. III: Polynomially implementable agents ⋮ A general theory of confluent rewriting systems for logic programming and its applications ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms ⋮ On the equivalence of the static and disjunctive well-founded semantics and its computation ⋮ Well-Founded and Partial Stable Semantics Logical Aspects ⋮ Semantics for Possibilistic Disjunctive Programs ⋮ Relating defeasible and normal logic programming through transformation properties. ⋮ Backdoors to tractable answer set programming

This page was built for publication: Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA