Electronic Notes in Theoretical Computer Science最新文献

Paracomplete Logics Dual to the Genuine Paraconsistent Logics: The Three-valued Case 对真副协调逻辑的对偶的准完全逻辑:三值情况

Electronic Notes in Theoretical Computer Science Pub Date : 2020-12-01 DOI: 10.1016/j.entcs.2020.10.006

Alejandro Hernández-Tello , Verónica Borja Macías , Marcelo E. Coniglio

引用次数: 3

An Ontology-based Approach to Describe Collaborative Work by Reusing and Enriching Data From an Institutional Repository 一种基于本体的方法，通过重用和丰富来自机构存储库的数据来描述协作工作

Electronic Notes in Theoretical Computer Science Pub Date : 2020-12-01 DOI: 10.1016/j.entcs.2020.10.010

María Auxilio Medina Nieto , Delia Arrieta Díaz , Jorge de la Calleja Mora , Laura Zacatzontetl Hernández , Marilú Zacatelco Pérez

引用次数: 1

Gradual Typing Using Union Typing With Records 对记录使用联合类型的渐进类型

Electronic Notes in Theoretical Computer Science Pub Date : 2020-12-01 DOI: 10.1016/j.entcs.2020.10.013

Karla Ramírez Pulido, Jorge Luis Ortega-Arjona, Lourdes del Carmen González Huesca

引用次数: 1

Weighted Complete Graphs for Condensing Data 压缩数据的加权完全图

Electronic Notes in Theoretical Computer Science Pub Date : 2020-12-01 DOI: 10.1016/j.entcs.2020.10.005

A. Guzmán-Ponce, J. Raymundo Marcial-Romero, R.M. Valdovinos-Rosas, J.S. Sánchez-Garreta

{"title":"Weighted Complete Graphs for Condensing Data","authors":"A. Guzmán-Ponce, J. Raymundo Marcial-Romero, R.M. Valdovinos-Rosas, J.S. Sánchez-Garreta","doi":"10.1016/j.entcs.2020.10.005","DOIUrl":"10.1016/j.entcs.2020.10.005","url":null,"abstract":"<div>In many real-world problems (such as industrial applications, chemistry models, social network analysis, among others), their solution can be obtained by transforming the problem in terms of vertices and edges, that is to say, using graph theory. Data Science applications are characterized by processing large volumes of data, in some cases, the data size can be higher than the resources for their processing, situation that makes prohibitive to use the traditional methods. In this way, to develop solutions based on graphs for condensing data can be a good strategy for handling big datasets. In this paper we include two methods for condensing data based on graphs, the two proposals consider a weighted complete graph by acquiring an induced subgraph or a minimum spanning tree from the whole datasets. We conducted some experiments in order to validate our proposals, using 24 benchmark real-datasets for training the 1NN, C4.5, and SVM classifiers. The results prove that our methods condensed the datasets without reducing the performance of the classifier, in terms of geometric means and the Wilcoxon's test.</div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"354 ","pages":"Pages 45-60"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.10.005","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90416388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

A Note on Constructive Interpolation for the Multi-Modal Logic Km 关于多模态逻辑构造插值的一个注记

Electronic Notes in Theoretical Computer Science Pub Date : 2020-12-01 DOI: 10.1016/j.entcs.2020.10.002

Everardo Bárcenas , José-de-Jesús Lavalle-Martínez , Guillermo Molero-Castillo , Alejandro Velázquez-Mena

{"title":"A Note on Constructive Interpolation for the Multi-Modal Logic Km","authors":"Everardo Bárcenas , José-de-Jesús Lavalle-Martínez , Guillermo Molero-Castillo , Alejandro Velázquez-Mena","doi":"10.1016/j.entcs.2020.10.002","DOIUrl":"10.1016/j.entcs.2020.10.002","url":null,"abstract":"<div>The Craig Interpolation Theorem is a well-known property in the mathematical logic curricula, with many domain applications, such as in the modularization of formal specifications and ontologies. This property states the following: given an implication, say formula ϕ implies another formula ψ, then there is a formula β, called the interpolant, in the common language of ϕ and ψ, such that ϕ also implies β, as well as β implies ψ. Although it is already known that the propositional multi-modal logic Km enjoys Craig interpolation, we are not aware of method providing an explicit construction of interpolants. We describe in this paper a constructive proof of the Craig interpolation property on the multi-modal logic Km. Interpolants can be explicitly computed from the proof. Furthermore, we also describe an upper bound for the computation of interpolants. The proof is based on the application of Maehara technique on a tree-hypersequent calculus. As a corollary of interpolation, we also show Beth definability and Robinson joint consistency.</div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"354 ","pages":"Pages 3-16"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.10.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78240198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Three New Genuine Five-valued Logics Intended to Model Non-trivial Concepts 拟模拟非平凡概念的三种新真五值逻辑

Electronic Notes in Theoretical Computer Science Pub Date : 2020-12-01 DOI: 10.1016/j.entcs.2020.10.012

Mauricio Osorio, Claudia Zepeda

引用次数: 0

Murphree's Numerical Term Logic Tableaux 墨菲的数值项逻辑表

Electronic Notes in Theoretical Computer Science Pub Date : 2020-12-01 DOI: 10.1016/j.entcs.2020.10.003

J. Martín Castro-Manzano

引用次数: 1

An Extension of the Stable Semantics via Lukasiewicz Logic 基于Lukasiewicz逻辑的稳定语义的扩展

Electronic Notes in Theoretical Computer Science Pub Date : 2020-12-01 DOI: 10.1016/j.entcs.2020.10.011

Mauricio Osorio, José Luis Carballido Carranza

引用次数: 0

A Heuristic for the Coloring of Planar Graphs 平面图形着色的一种启发式算法

Electronic Notes in Theoretical Computer Science Pub Date : 2020-12-01 DOI: 10.1016/j.entcs.2020.10.008

Guillermo De Ita Luna, Cristina López-Ramírez, Ana E. De Ita-Varela, Jorge E. Gutiérrez-Gómez

{"title":"A Heuristic for the Coloring of Planar Graphs","authors":"Guillermo De Ita Luna, Cristina López-Ramírez, Ana E. De Ita-Varela, Jorge E. Gutiérrez-Gómez","doi":"10.1016/j.entcs.2020.10.008","DOIUrl":"10.1016/j.entcs.2020.10.008","url":null,"abstract":"<div>We present an algorithm for the coloring of planar graphs based on the construction of a maximal independent set S of the input graph. The maximal independent set S must fulfill certain characteristics. For example, S contains the vertex that appears in a maximum number of odd cycles of G. The construction of S considers the internal-face graph of the input graph G in order to select each vertex belonging to a maximal number of odd faces of G.The traversing in pre-order on the internal-face graph Gf of the input planar graph G provides us of a strategy for the construction of partial maximal independent sets of critical regions of Gf. Thus, the union of these partial maximal independent sets forms a maximal independent set S of G. This allows us to color first the vertices that are crucial for decomposing G in a graph (G − S), which is a polygonal tree, and therefore, is 3-colorable.</div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"354 ","pages":"Pages 91-105"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.10.008","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88415087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On Interactive Proof-Search for Constructive Modal Necessity 论建构性情态必然性的交互式证明搜索

Electronic Notes in Theoretical Computer Science Pub Date : 2020-12-01 DOI: 10.1016/j.entcs.2020.10.009

Favio E. Miranda-Perea, Lourdes del Carmen González Huesca, P. Selene Linares-Arévalo

引用次数: 1