How to deal with unbelievable assertions

DOI10.1007/S10472-015-9493-3MaRDI QIDQ524943zbMATH OpenOpenAlexFDO

Authors Matti Nykänen, Raul Hakli, Satu Eloranta, Olli Niinivaara

Publication date 27 April 2017

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10138/177967

zbMATH Keywords

argumentationbelief revisionconvictionsdialogue protocols

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42) Logic in computer science (03B70)

Recommendations

• How strong can an agent believe reported information?
• Computational Logic in Multi-Agent Systems
• (DIS)BELIEF CHANGE AND ARGUED FEED-BACK DIALOG
• Collecting Information Reported by Imperfect Information Sources
• Contradictory information as a basis for rational belief

Cites work

• scientific article; zbMATH DE number 3957109 (Why is no real title available?)
• scientific article; zbMATH DE number 47306 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1946872 (Why is no real title available?)
• scientific article; zbMATH DE number 1497485 (Why is no real title available?)
• scientific article; zbMATH DE number 4197471 (Why is no real title available?)
• A Protocol for Arguing About Rejections in Negotiation
• A survey of non-prioritized belief revision
• Accommodative Belief Revision
• Belief contraction without recovery
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Credibility limited revision
• Epistemology without knowledge and without belief
• How Agents Alter Their Beliefs After an Argumentation-Based Dialogue
• Interpolant strength
• Interpolation and SAT-based model checking.
• Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
• Knowledge in flux. Modeling the dynamics of epistemic states
• Lower bounds for resolution and cutting plane proofs and monotone computations
• New Types of Inter-agent Dialogues
• On the logic of iterated belief revision
• On the logic of theory change: Partial meet contraction and revision functions
• Principles and Practice of Constraint Programming – CP 2004
• Properties and Complexity of Some Formal Inter-agent Dialogues
• Propositional Interpolation and Abstract Interpretation
• Propositional information systems
• Propositional knowledge base revision and minimal change
• Propositional relevance through letter-sharing
• Selective revision
• Semi-revision
• Tautologies with a unique Craig interpolant, uniform vs. nonuniform complexity

This page was built for publication: How to deal with unbelievable assertions

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