Strong and explicit negation in non-monotonic reasoning and logic programming

DOI10.1007/3-540-61630-6_10zbMath1426.68256OpenAlexW1564586270MaRDI QIDQ5236430

José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski

Publication date: 8 October 2019

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61630-6_10

zbMATH Keywords

belief revisionnonmonotonic reasoninglogic programmingclassical negation

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (2)

Autoepistemic logic of knowledge and beliefs ⋮ Disjunctive logic programs, answer sets, and the cut rule

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantical considerations on nonmonotonic logic
• On the relationship between circumscription and negation as failure
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Static semantics for normal and disjunctive logic programs
• Logic programming and reasoning with incomplete information
• Non-monotonic reasoning with logic programming
• The well-founded semantics for general logic programs
• Abduction over 3-valued extended logic programs
• Constructible falsity

This page was built for publication: Strong and explicit negation in non-monotonic reasoning and logic programming