Alfredo Burrieza

dblp:79/4097 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
1since 2021 · last 2022
0000-0002-2033-6033ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 3 first-authorTheory of computation · 3 · 2 first-author · 1 since 2021
YearPublicationVenuePosition
2022 A multi-modal logic for Galois connections
Inmaculada Perez de Guzmán, Antonio Yuste-Ginel, Alfredo Burrieza
AiML3
2020 Basic Beliefs and Argument-Based Beliefs in Awareness Epistemic Logic with Structured Arguments
abstract
There are two intuitive principles governing belief formation and argument evaluation that can potentially clash. After arguing that adopting them unrestrictedly leads to an infinite regress, we propose a formal framework in which qualified versions of both principles can be subscribed without falling into such a regress. The proposal integrates tools from two different traditions: structured argumentation and awareness epistemic logic. We show that our formalism satisfies certain rationality postulates and argue that the rest of them can be seen as too ideal when modelling resource-bounded agents.
Alfredo Burrieza, Antonio Yuste-Ginel
COMMA1
2014 A logic framework for reasoning with movement based on fuzzy qualitative representation
Emilio Muñoz-Velasco, Alfredo Burrieza, Manuel Ojeda-Aciego
Fuzzy Sets Syst.2
2013 A logic with imprecise probabilities and an application to automated reasoning using rewriting techniques
Inmaculada Fortes, María Ángeles Galán García, Gabriel Aguilera Venegas, Alfredo Burrieza, J. Morones, Sixto Sánchez
Fuzzy Sets Syst.4
2011 A PDL Approach for Qualitative Velocity
abstract
We introduce the syntax, semantics, and an axiom system for a PDL-based extension of the logic for order of magnitude qualitative reasoning, developed in order to deal with the concept of qualitative velocity, which together with qualitative distance and orientation, are important notions in order to represent spatial reasoning for moving objects, such as robots. The main advantages of using a PDL-based approach are, on the one hand, all the well-known advantages of using logic in AI, and, on the other hand, the possibility of constructing complex relations from simpler ones, the flexibility for using different levels of granularity, its possible extension by adding other spatial components, and the use of a language close to programming languages.
Alfredo Burrieza, Emilio Muñoz-Velasco, Manuel Ojeda-Aciego
Int. J. Uncertain. Fuzziness Knowl. Based Syst.1
2005 A Multimodal Logic Approach to Order of Magnitude Qualitative Reasoning with Comparability and Negligibility Relations
Alfredo Burrieza, Manuel Ojeda-Aciego
Fundam. Informaticae1
2003 A functional approach for temporal × modal logics
Alfredo Burrieza, Inmaculada Perez de Guzmán
Acta Informatica1
2002 Indexed Flows in Temporal x Modal Logic with Functional Semantics
abstract
Two classical semantical approaches to studying logics which combine time and modality are the T /spl times/ W-frames and Kamp-frames (Thomason (1984)). In this paper we study a new kind of frame that extends the one introduced in Burrieza et al. (2002). The motivation is twofold: theoretical, i.e., representing properties of the basic theory of functions (definability); and practical, their use in computational applications (considering time-flows as memory of computers connected in a net, each computer with its own clock). Specifically, we present a temporal /spl times/ modal (labelled) logic, whose semantics are given by ind-functional frames in which accessibility functions are used in order to interconnect time-flows. This way, we can: (i) specify to what time-flow we want to go; (ii) carry out different comparisons among worlds with different time measures; and (iii) define properties of certain kinds of functions (in particular, of total, injective, surjective, constant, increasing and decreasing functions), without the need to resort to second-order theories. In addition, we define a minimal axiomatic system and give the completeness theorem (Henkin-style).
Alfredo Burrieza, Inmaculada Perez de Guzmán, Emilio Muñoz-Velasco
TIME1