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

DOI10.1080/11663081.2014.911520MaRDI QIDQ4583344zbMATHOpenAlexFDO

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

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

human reasoningwell-founded semanticsthree-valued logicsweak completion semanticsŁukasiewicz logicsuppression task

Mathematics Subject Classification ID

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

Recommendations

• Conditional Reasoning and Relevance
• A core method for the weak completion semantics with skeptical abduction
• A new computational logic approach to reason with conditionals
• From logic programming to human reasoning: how to be artificially human
• Logics with Common Weak Completions

Cites work

• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• scientific article; zbMATH DE number 4160107 (Why is no real title available?)
• scientific article; zbMATH DE number 25193 (Why is no real title available?)
• scientific article; zbMATH DE number 3392404 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A kripke-kleene semantics for logic programs*
• A rational reconstruction of nonmonotonic truth maintenance systems
• A treatise on many-valued logics
• A uniform approach to logic programming semantics
• Abductive Logic Programming
• Computing abduction by using TMS with top-down expectation
• Contributions to the Theory of Logic Programming
• Logic Programs under Three-Valued Łukasiewicz Semantics
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs
• Tight logic programs
• Well-founded and stationary models of logic programs

Cited in

(7)

• Do humans reason with \(\mathcal{E} \)-matchers?
• Logic Programming, Argumentation and Human Reasoning
• A core method for the weak completion semantics with skeptical abduction
• Conditional Reasoning and Relevance
• The weak completion semantics and equality
• From logic programming to human reasoning: how to be artificially human
• On the cognitive logic of human propositional reasoning: merging ranking functions

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

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