Zobrazeno 1 - 10
of 240
pro vyhledávání: '"Cerro, Luis"'
In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in this logic, two principles that we call non-contradictory inference and
Externí odkaz:
http://arxiv.org/abs/2203.14405
Ivlev's pioneering work started in the 1970's showed a new and promissory way in the study of modal logic from the perspective of many-valued logics. Continuing our previous work on Ivlev-like non-normal modal logics with non-deterministic semantics,
Externí odkaz:
http://arxiv.org/abs/2202.02136
In the first part of this paper we analyzed finite non-deterministic matrix semantics for propositional non-normal modal logics as an alternative to the standard Kripke's possible world semantics. This kind of modal systems characterized by finite no
Externí odkaz:
http://arxiv.org/abs/2101.02259
Autor:
Alliot, Jean-Marc, Mayer, Marta Cialdea, Demolombe, Robert, Diéguez, Martín, del Cerro, Luis Fariñas
Metabolic networks, formed by a series of metabolic pathways, are made of intracellular and extracellular reactions that determine the biochemical properties of a cell, and by a set of interactions that guide and regulate the activity of these reacti
Externí odkaz:
http://arxiv.org/abs/2008.09546
Dynamic Epistemic Logic (DEL) is a family of multimodal logics that has proved to be very successful for epistemic reasoning in planning tasks. In this logic, the agent's knowledge is captured by modal epistemic operators whereas the system evolution
Externí odkaz:
http://arxiv.org/abs/1905.10621
Publikováno v:
Theory and Practice of Logic Programming 21 (2021) 296-316
Epistemic logic programs constitute an extension of the stable models semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some regular literal is true in all stable model
Externí odkaz:
http://arxiv.org/abs/1812.08763
In 1988, Ivlev proposed four-valued non-deterministic semantics for modal logics in which the alethic T axiom holds good. Unfortunately, no completeness was proved. In previous work, we proved completeness for some Ivlev systems and extended his hier
Externí odkaz:
http://arxiv.org/abs/1808.10007
In this paper, we propose a variant of Answer Set Programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logical treatment of aggregates. Formally, we start from the syntax of First
Externí odkaz:
http://arxiv.org/abs/1805.00660
Publikováno v:
In Fuzzy Sets and Systems 20 September 2022 445:43-65
Publikováno v:
In Fuzzy Sets and Systems 30 November 2021 425:140-156