Modeling the suppression task under weak completion and well-founded semantics

DOI10.1080/11663081.2014.911520zbMath1398.03152OpenAlexW2003531800MaRDI QIDQ4583344

Christoph Wernhard, Emmanuelle-Anna Dietz, Steffen Hölldobler

Publication date: 28 August 2018

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2014.911520

zbMATH Keywords

well-founded semanticsŁukasiewicz logichuman reasoningthree-valued logicsweak completion semanticssuppression task

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Logic in computer science (03B70) Logic programming (68N17) Many-valued logic (03B50)

Related Items (1)

Logic Programming, Argumentation and Human Reasoning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Well-founded and stationary models of logic programs
• A rational reconstruction of nonmonotonic truth maintenance systems
• A kripke-kleene semantics for logic programs*
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs
• Computing abduction by using TMS with top-down expectation
• A uniform approach to logic programming semantics
• Tight logic programs
• Abductive Logic Programming
• Logic Programs under Three-Valued Łukasiewicz Semantics

This page was built for publication: Modeling the suppression task under weak completion and well-founded semantics