Handling Paraconsistency and Paracompleteness in Robotics

Abstract

Automation, and Robotics have experienced incredible improvements over the past decades. Due to the high sophistication more and more elaborated logical tool became necessary to overcome what classical logic offers. In this work, it is shown how a new class of non-classical logics, namely paraconsistent annotated evidential logic Eτ, can be used to deal situations where the presence of conflicting, diffuse and paracomplete must be treated in a non-trivial way. Our purpose is to show its usefulness through examples that have been successfully applied.