Logic programming with default, weak and strict negations

DOI10.1017/S1471068406002791MaRDI QIDQ3422418zbMATH OpenOpenAlexFDO

Authors Susumu Yamasaki

Publication date 13 February 2007

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s1471068406002791

zbMATH Keywords

negation in logic programmingthree-valued logic

Mathematics Subject Classification ID

Many-valued logic (03B50) Logic programming (68N17)

Recommendations

• Programming in three-valued logic
• Publication:5750391
• scientific article; zbMATH DE number 879002
• Logic programming with strong negation
• scientific article; zbMATH DE number 9973

Cited in

(6)

• Negation and constraint logic programming
• Logic programming: laxness and saturation
• scientific article; zbMATH DE number 4147555 (Why is no real title available?)
• scientific article; zbMATH DE number 9973 (Why is no real title available?)
• A three-valued approach to default logic
• Defeasible logic versus Logic Programming without Negation as Failure

This page was built for publication: Logic programming with default, weak and strict negations

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