The invasion of the new technologies in our lives and the current dependence upon them makes us believe that in a not too distant future we will be made of more technology than biological matter. If until recently computers had hardly been discovered, today we are witnessing a real technological revolution in all the fields: biology, medicine etc. The evolution of the new technologies has raised various questions related to the future of mankind and the current human species, which determines (...) us to make speculations regarding a future event that may occur. For this reason, in this paper I shall analyze the concept of artificial intelligence and singularity and I shall also outline the relationship between the ontological argument and the possible worlds. The idea of possible world can serve as a way of describing a metaphor in the philosophy of science, as singularity can exist in a possible world only if one creates the conditions of a new concept regarding fiction. We believe that technological singularity will change the values of the current society and the individual will have to face a world that depersonalizes the individual, as transhumanism draws the theoretical frameworks of a ‹‹brave new world››. In this paper, we have also analyzed the logical explanation of God's existence and the explanation of singularity through artificial intelligence. Therefore, we shall bring up for discussion the idea of virtual universe in the context of downloaded consciousness, which can be operated through artificial intelligence. Our conclusions refer to the fact that eternal life could exist artificially, but it cannot be demonstrated in terms of the ontological argument. (shrink)

dialectical frameworks have been introduced as a formalism for modeling argumentation allowing general logical satisfaction conditions and the relevant argument evaluation. Different criteria used to settle the acceptance of arguments are called semantics. Semantics of ADFs have so far mainly been defined based on the concept of admissibility. However, the notion of strongly admissible semantics studied for abstract argumentation frameworks has not yet been introduced for ADFs. In the current work we present the concept of strong admissibility of interpretations for (...) ADFs. Further, we show that strongly admissible interpretations of ADFs form a lattice with the grounded interpretation as the maximal element. We also present algorithms to answer the following decision problems: whether a given interpretation is a strongly admissible interpretation of a given ADF, and whether a given argument is strongly acceptable/deniable in a given interpretation of a given ADF. In addition, we show that the strongly admissible semantics of ADFs forms a proper generalization of the strongly admissible semantics of AFs. (shrink)

dialectical frameworks constitute a recent and powerful generalisation of Dung's argumentation frameworks, where the relationship between the arguments can be specified via Boolean formulas. Recent results have shown that this enhancement comes with the price of higher complexity compared to AFs. In fact, acceptance problems in the world of ADFs can be hard even for the third level of the polynomial hierarchy. In order to implement reasoning problems on ADFs, systems for quantified Boolean formulas thus are suitable engines to be (...) employed. In this paper we give complexity sensitive QBF encodings of ADF problems generalising recent work on QBFs for AF labellings. Our encodings provide a uniform and modular way of translating reasoning in ADFs to QBFs, that can be used as the basis for novel systems for ADF reasoning. (shrink)