A rewriting method for well-founded semantics with explicit negation

DOI10.1007/3-540-45619-8_26MaRDI QIDQ4812973zbMATH OpenFDO

Authors Pedro Cabalar

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2401/24010378.htm

Mathematics Subject Classification ID

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

Recommendations

• Default theory for well founded semantics with explicit negation
• A tutorial on the well-founded semantics
• A logic programming system for nonmonotonic reasoning
• Transformation-based bottom-up computation of the well-founded model
• On the problem of computing the well-founded semantics

Cited in

(2)

• A rewrite mechanism for logic programs with negation
• Theoretical Aspects of Computing - ICTAC 2004

This page was built for publication: A rewriting method for well-founded semantics with explicit negation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4812973)