Electronic Notes in Theoretical Computer Science最新文献

In 2016 Béziau, introduce a restricted notion of paraconsistency, the so-called genuine paraconsistency. A logic is genuine paraconsistent if it rejects the laws φ,¬φ ⊢ ψ and ⊢ ¬(φ ∧ ¬φ). In that paper the author analyzes, among the three-valued logics, which of them satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above mentioned are ⊢ φ,¬φ and ¬(ψ∨¬ψ) ⊢. We call genuine paracomplete logics those rejecting the mentioned properties. We present here an analysis of the three-valued genuine paracomplete logics.

Besides tutoring and consultancies, the development of academic and scientific documents in universities evidenced collaborative work. This paper presents an ontology-based approach to describe different modes of collaboration by reusing and enriching data from an institutional repository, from a collection of posters. The approach uses an application ontology that makes explicit the relationships among authors and posters. The paper presents a list of competency questions that are answered in natural language and by the ontology terminology. The proposed approach is of value as this offers machine-readable data to support further analysis and inference mechanisms. This paper represents a reviewed version of the described for the CEUR proceedings for the “Twelfth Latin American Workshop on New Methods of Reasoning 2019 Logic / Languages, Algorithms, New Methods of Reasoning (LANMR 2019)”.

Dynamic typed languages are characterized by their expressiveness and flexibility to develop prototypes, while static typed languages allow early detection of errors and the optimization of source code. Gradual typing languages allow programmers to make use of both approaches, static and dynamic typing, and thus, obtaining the advantages that both represent.

The objective here is to revisit the static part of the approach to a gradual interpretation of union types based on the design of Gradual Union Types through an extension with the record data-structure. This contributes to understand the abstraction and reasoning behind Gradual Typing in order to have useful future extensions for other data-structures.

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.

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 K_m 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 K_m. 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.

We introduce three 5-valued paraconsistent logics that we name FiveASP1, FiveASP2 and FiveASP3. Each of these logics is genuine and paracomplete. The new value is called e attempting to model the notion of ineffability. If one drops e from any of these logics one obtains a well known 4-valued logic introduced by Avron. If, on the other hand one drops the “implication” connective from any of these logics, one obtains Priest logic FDEe. We present some properties of these logics.

Murphree's Numerical Term Logic is a logic capable of representing and performing inference with numerical quantifiers by modifying Sommers' Term Functor Logic: in this contribution we offer a tableaux method for it.

Logic Programming and fuzzy logic are active areas of research, and their scopes in terms of applications are growing fast. Fuzzy logic is a branch of many-valued logic based on the paradigm of inference under vagueness. In this work we recall some of the interplay between three 3-valued logics that are relevant in these areas: The Lukasiewicz logic, the intermediate logic G₃ and the paraconsistent logic $G_3^{\prime }$, and we present a contribution to the area of answer sets that consists in extending a definition of stable model based on proof theory in logic G₃, to a more general definition that can be based on any of the more expressive logics $G_3^{\prime }$ or Lukasiewicz. Finally we present and explore a new 4-valued logic that bears relation to G₃ and to Lukasiewicz 4-valued logic.

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 G_f of the input planar graph G provides us of a strategy for the construction of partial maximal independent sets of critical regions of G_f. 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.

We present a dual sequent calculus for the necessity fragment of the constructive modal logic S4 and show its adequacy for proof-search in the style of modern interactive theorem provers. The main feature of dual systems is the use of two contexts to capture the notions of true and valid formulas, without using any formal semantics. This attribute allows us to give simple rules for the □ operator that, most of the time, grant the substitution of a strict modal reasoning by a pure propositional one, thus simplifying the proof-search process. Moreover, we introduce a formal notion of backward proof corresponding to a bottom-up construction of a derivation tree by means of a left-to-right depth-first proof-search.