How to deal with unbelievable assertions

DOI10.1007/S10472-015-9493-3zbMATH Open1396.03081OpenAlexW2261858877MaRDI QIDQ524943FDOQ524943

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

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

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)

Cites Work

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

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)