Logical Omnipotence and Two notions of Implicit Belief

The most widespread models of rational reasoners (the model based on modal epistemic logic and the model based on probability theory) exhibit the problem of logical omniscience. The most common strategy for avoiding this problem is to interpret the models as describing the explicit beliefs of an ideal reasoner, but only the implicit beliefs of a real reasoner. I argue that this strategy faces serious normative issues. In this paper, I present the more fundamental problem of logical omnipotence, which highlights the normative content of the problem of logical omniscience. I introduce two developments of the notion of implicit belief (accessible and stable belief ) and use them in two versions of the most common strategy applied to the problem of logical omnipotence

Robust Spoken Language Understanding for House Service Robots

Service robotics has been growing significantly in thelast years, leading to several research results and to a numberof consumer products. One of the essential features of theserobotic platforms is represented by the ability of interactingwith users through natural language. Spoken commands canbe processed by a Spoken Language Understanding chain, inorder to obtain the desired behavior of the robot. The entrypoint of such a process is represented by an Automatic SpeechRecognition (ASR) module, that provides a list of transcriptionsfor a given spoken utterance. Although several well-performingASR engines are available off-the-shelf, they operate in a generalpurpose setting. Hence, they may be not well suited in therecognition of utterances given to robots in specific domains. Inthis work, we propose a practical yet robust strategy to re-ranklists of transcriptions. This approach improves the quality of ASRsystems in situated scenarios, i.e., the transcription of roboticcommands. The proposed method relies upon evidences derivedby a semantic grammar with semantic actions, designed tomodel typical commands expressed in scenarios that are specificto human service robotics. The outcomes obtained throughan experimental evaluation show that the approach is able toeffectively outperform the ASR baseline, obtained by selectingthe first transcription suggested by the AS

Performance Analysis of a 5G Transceiver Implementation for Remote Areas Scenarios

The fifth generation of mobile communication networks will support a large set of new services and applications. One important use case is the remote area coverage for broadband Internet access. This use case ha significant social and economic impact, since a considerable percentage of the global population living in low populated area does not have Internet access and the communication infrastructure in rural areas can be used to improve agribusiness productivity. The aim of this paper is to analyze the performance of a 5G for Remote Areas transceiver, implemented on field programmable gate array based hardware for real-time processing. This transceiver employs the latest digital communication techniques, such as generalized frequency division multiplexing waveform combined with 2 by 2 multiple-input multiple-output diversity scheme and polar channel coding. The performance of the prototype is evaluated regarding its out-of-band emissions and bit error rate under AWGN channel.Comment: Presented in 2018 European Conference on Networks and Communications (EuCNC),18-21 June, 2018, Ljubljana, Sloveni

Ideal Reasoners don’t Believe in Zombies

The negative zombie argument concludes that physicalism is false from the premises that p ∧¬q is ideally negatively conceivable and that what is ideally negatively conceivable is possible, where p is the conjunction of the fundamental physical truths and laws and q is a phenomenal truth (Chalmers 2002; 2010). A sentence φ is ideally negatively conceivable iff φ is not ruled out a priori on ideal rational reflection. In this paper, I argue that the negative zombie argument is neither a priori nor conclusive. First, I argue that the premises of the argument are true only if there exists an adequate finite ideal reasoner R that believes ◊(p ∧ ¬q) on the basis of not believing p→q on a priori basis. Roughly, a finite reasoner is a reasoner with cognitive limitations (e.g. finite memory). I argue that R is finite only if R reasons nonmonotonically and only approach ideal reflection at the limit of a reasoning sequence. This would render the argument nonconclusive. Finally, I argue that, for some q, R does not believe ◊(p ∧ ¬q) on the basis of not believing p→q on a priori basis (e.g. for q =‘something is conscious’). This would render the choice of an adequate q dependent on empirical information (and the argument a posteriori). I conclude that the negative zombie argument (and, maybe, all zombie arguments) is neither a priori nor conclusive