It is often easier to persuade someone that something is impossible to do than that it is possible, since the absence of one necessary resource suffices. This makes lying a tempting tactic for negative persuasion. We consider the problem of finding convincing lies for it as one of maintaining consistency of a set of logical assertions; we can track that consistency with a computer program. We use an example of negative persuasion against electronic voting in elections, where automated analysis then suggests ways to prevent it. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Rowe, N. C. (2007). Logical modeling of deceptive negative persuasion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4744 LNCS, pp. 105–108). Springer Verlag. https://doi.org/10.1007/978-3-540-77006-0_14
Mendeley helps you to discover research relevant for your work.