Examinando Lenguajes y Semánticas por Título
Mostrando 1 - 3 de 3
Resultados por página
Opciones de ordenación
ArtículoA Logic of Graph Conditions Extended with PathsNavarro, Marisa; Orejas, Fernando; Pino, Elvira; Lambers, Leen. Actas de las XVI Jornadas de Programación y Lenguajes (PROLE 2016), 2016-09-02.In this paper we tackle the problem of extending the logic of nested graph conditions with paths. This means, for instance, that we may state properties about the existence of paths between some given nodes. As a main contribution, a sound and complete tableau method is defined for reasoning about this kind of properties. ArtículoFormal Relational Languages in a Deductive SettingSáenz Pérez, Fernando. Actas de las XVI Jornadas de Programación y Lenguajes (PROLE 2016), 2016-09-02.The relational data model coincides with the deductive one and, thus, formal relational query languages can be mapped to a deductive setting. These languages include, on the one hand, Tuple Relational Calculus (TRC) and Domain Relational Calculus (DRC). It can be argued that TRC can be seen as the formal basis of SQL, while DRC does the same for the semantic web language SPARQL and even the graphical relational language Query-by-Example (QBE). On the other hand, Relational Algebra (RA) is also used as a target language for intermediate compilations from SQL to executable query plans. As commonly acknowledged, RA allows a more formal setting for query optimizations than SQL. In this work, we describe the new support of TRC and DRC in the deductive system DES (which included already SQL and RA) with the aim to have an integrated system for learning database query (formal) languages based on logic. ArtículoFuzzy Thresholded Fixpoint SemanticsJulián Iranzo, Pascual; Moreno, Ginés; Penabad, Jaime. Actas de las XVI Jornadas de Programación y Lenguajes (PROLE 2016), 2016-09-02.This work proposes an immediate consequences operator that allows us to give a fixpoint characterization of the least Herbrand model for a powerful class of fuzzy logic programs coping with implicit/explicit truth degree annotations, a great variety of connectives and unification by similarity. The so-called FASILL language (acronym of “Fuzzy Aggregators and Similarity Into a Logic Language”) has been recently designed and implemented in our research group and it enjoys the capability for managing filters or thresholds in a natural way in order to relax some computational and declarative aspects as revealed in the proposed fixpoint semantics.