The weak completion semantics and equality

DOI10.29007/PR47MaRDI QIDQ5222964zbMATH OpenOpenAlexFDO

Authors Emmanuelle-Anna Dietz, Steffen Hölldobler, Sibylle Schwarz, Lim Yohanes Stefanus

Publication date 4 July 2019

Published in EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.29007/pr47

zbMATH Keywords

logic programmingequational reasoningcounterfactual reasoningfluent calculuscognitive reasoningweak completionthree-valued Łukasiewicz logicethical decision-making

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Do humans reason with \(\mathcal{E} \)-matchers?
• A core method for the weak completion semantics with skeptical abduction
• Conditional Reasoning and Relevance
• Logics with Common Weak Completions
• Modeling the suppression task under weak completion and well-founded semantics

Cited in

(5)

• Completion of first-order clauses with equality by strict superposition
• Conditional Reasoning and Relevance
• A core method for the weak completion semantics with skeptical abduction
• Do humans reason with \(\mathcal{E} \)-matchers?
• scientific article; zbMATH DE number 7695589 (Why is no real title available?)

This page was built for publication: The weak completion semantics and equality

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