A top-down procedure for disjunctive well-founded semantics

DOI10.1007/3-540-45744-5_22MaRDI QIDQ4539613zbMATH OpenFDO

Authors Kewen Wang

Publication date 10 July 2002

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/2083/20830305

Mathematics Subject Classification ID

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

Recommendations

• Comparisons and computation of well-founded semantics for disjunctive logic programs
• On the computation of the disjunctive well-founded semantics
• A comparative study of well-founded semantics for disjunctive logic programs
• scientific article; zbMATH DE number 846973
• A goal-oriented approach to computing the well-founded semantics

Cited in

(3)

• Bottom-up computation of perfect models for disjunctive theories
• TOPOS BASED SEMANTIC FOR CONSTRUCTIVE LOGIC WITH STRONG NEGATION
• On the computation of the disjunctive well-founded semantics

This page was built for publication: A top-down procedure for disjunctive well-founded semantics

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