http://biblioteca.universia.net/vernivel.do?start=80&nivel=11 Mostrando recursos 81 - 100 de 88,631 es http://biblioteca.universia.net/img/logotipo.jpg http://biblioteca.universia.net/ http://biblioteca.universia.net/ficha.do?id=44777650 It is shown that the axioms of the intuitionistic logic can be proved as theorems in the frames of the intuitionistic fuzzy logic. Atanassov, Krassimir T. http://biblioteca.universia.net/ficha.do?id=46206231 Thérien and Wilke characterized the Until hierarchy of linear temporal logic in terms of aperiodic monoids. Here, a temporal operator able to count modulo q is introduced. Temporal logic augmented with such operators is found decidable as it is shown to express precisely the solvable regular languages. Natural hierarchies are shown to arise when modular and conventional operators are interleaved. Modular operators are then cast as special cases of more general "group" temporal opera... Augustin Baziramwabo; Pierre Mckenzie; Denis Thérien http://biblioteca.universia.net/ficha.do?id=41513161 Classical logic enforces the separation of individuals and predicates, linear logic draws them together via interaction; these are not right-or-wrong alternatives but dual or complementary logics. Linear logic is an incomplete realization of this duality. While its completion is not essential for the development and maintenance of logic, it is crucial for its application. We outline the "four-square" program for completing the connection, whose corners are set, function, number, and arithmeti... Vaughan Pratt http://biblioteca.universia.net/ficha.do?id=46183107 In this paper we define the rather general framework of Monotonic Logic Programs, where the main results of (definite) logic programming are validly extrapolated. Whenever defining new logic programming extensions, we can thus turn our attention to the stipulation and study of its intuitive algebraic properties within the very general setting. Then, the existence of a minimum model and of a monotonic immediate consequences operator is guaranteed, and they are related as in classical logic pro... Carlos Viegas Damásio; Luís Moniz Pereira http://biblioteca.universia.net/ficha.do?id=46267932 In this paper we define the rather general framework of Monotonic Logic Programs, where the main results of (definite) logic programming are validly extrapolated. Whenever defining new logic programming extensions, we can thus turn our attention to the stipulation and study of its intuitive algebraic properties within the very general setting. Then, the existence of a minimum model and of a monotonic immediate consequences operator is guaranteed, and they are related as in classical logic pro... Carlos Viegas Damásio; Luís Moniz Pereira http://biblioteca.universia.net/ficha.do?id=48023441 We consider a paradigm of applications of Logic Engineering to illustrate the information interchange among different areas of knowledge, through the formal approach to some aspects of computing. We apply the paradigm to the area of distributed systems, taking the demand for specification formalisms, treated in three areas of knowledge: modal logics, first-order logic and algebra. In doing so, we obtain transfer of intuitions and results, establishing that, as far as input/output representati... Renata P. De Freitas; Progr Eng; Sist Comput http://biblioteca.universia.net/ficha.do?id=20846894 This paper presents an abstract, mathematical formulation of classical propositional logic. It proceeds layer by layer: (1) abstract, syntax-free propositions; (2) abstract, syntax-free contraction-weakening proofs; (3) distribution; (4) axioms (p OR NOT p). Abstract propositions correspond to objects of the category G(Rel^L) where G is the Hyland-Tan double glueing construction, Rel is the standard category of sets and relations, and L is a set of literals. Abstract proofs are morphisms ... Hughes, Dominic http://biblioteca.universia.net/ficha.do?id=38505752 FLEB is an electronic book which attempts to introduce the basic mathematical foundations and applications of fuzzy logic through a software environment which includes images, hypertext, sensitive elements, animations and interactive demos. It also allows executing Xfuzzy, a development tool which eases the description, verification, and synthesis of fuzzy logic-based systems. FLEB, like a usual book, is structured into chapters with pages through which the reader can navigate comfortably. In... Bermúdez, Andrés; Barriga, Angel; Baturone, M.ª Iluminada; Sánchez-Solano, Santiago http://biblioteca.universia.net/ficha.do?id=46450193 this paper we investigate logic programming with ordered hypotheses. We follow the paradigm that logic programming should be understood via an abstract notion of uniform derivation [MNPS91] which, in a slight abuse of terminology, we take to encompass goal-directed search and focussed use of hypotheses [And92]. Somewhat unexpectedly, the extension of these notions from the case of linear logic [HM94] is far from straightforward. The principal contributions of this paper are 1. a system of ord... Frank Pfenning; Jeff Polakow; Jeff Polakow http://biblioteca.universia.net/ficha.do?id=44777596 Logic and Probability, as theories, have been developed quite independently and, with a few exceptions (like Boole's), have largely ignored each other. And nevertheless they share a lot of similarities, as well a considerable common ground. The exploration of the shared concepts and their mathematical treatment and unification is here attempted following the lead of illustrious researchers (Reichenbach, Carnap, Popper, Gaifman, Scott & Krauss, Fenstad, Miller, David Lewis, Stalnaker, Hintikka... Sales, Ton http://biblioteca.universia.net/ficha.do?id=44780435 To investigate more reasonable fuzzy reasoning model in expert systems as well as more effective logical circuit in fuzzy control, a (T, ^, N) fuzzy logic is proposed in this paper by using T-norm, ^-norm and pseudo-complement N as the logical connectives. Two aspects are discussed: (1) some concepts of (T, ^, N) fuzzy logic are introduced and some properties of (T, ^, N) fuzzy logical formulae are discussed. (2) G-fuzzy truth (falsity) of (T, ^, N) fuzzy logical formulae are investigated and... Xu, Y.; Liu, J.; Ruan, D. http://biblioteca.universia.net/ficha.do?id=41828226 This paper is the first part of a work whose purpose is to investigate duality in some related frameworks (cartesian closed categories, lambda-calculi, intuitionistic and classical logics) from syntactic, semantical and computational viewpoints. We start with category theory and we show that any bicartesian closed category with coexponents is degenerated (i.e. there is at most one arrow between two objects). The remainder of the paper is devoted to logical issues. We examine the propositional... Tristan Crolard http://biblioteca.universia.net/ficha.do?id=44778843 The logic of signed formula can be used to reason about a wide variety of multiple-valued logics [Häh94b, LMR97]. The formal theoretical foundation of multiple-valued logic programming based on signed formulas is set forth in [Lu96]. The current paper is an investigation into the operational semantics of such signed logic programming. The connection of signed logic programming to constraint logic programming is presented, search space issues are briefly discussed for both general and special ... Lu, James J.; Calmet, Jacques; Schü, Joachim http://biblioteca.universia.net/ficha.do?id=46640540 this paper we investigate logic programming with ordered hypotheses. We follow the paradigm that logic programming should be understood via an abstract notion of uniform derivation [MNPS91] which, in a slight abuse of terminology, we take to encompass goal-directed search and focussed use of hypotheses [And92]. Somewhat unexpectedly, the extension of these notions from the case of linear logic [HM94] is far from straightforward. The principal contributions of this paper are 1. a system of ord... Jeff Polakow; Frank Pfenning; Frank Pfenning http://biblioteca.universia.net/ficha.do?id=45870131 We study the algebraic closure construction for metric structures in the setting of continuous first order logic. We give several characterizations of algebraicity, and we prove basic properties analogous to ones that algebraic closure satisfies in classical first order logic. Henson, C. Ward; Tellez, Hernando http://biblioteca.universia.net/ficha.do?id=38555212 En: III Congreso español de tecnologías y lógica fuzzy comp. por S. Barro & A. Sobrino. Santiago de Compostela: Universidad de Santiago, 1993 pp. 115-22. ISBN 84-604-7510-7. Peña, Lorenzo http://biblioteca.universia.net/ficha.do?id=42109762 three above mentioned Gentzen systems are presented, together with the structural and multiple-conclusion versions GBC and GBC of GB and GBL , respectively. Then Theorem 4.88 of [7] states the same as Theorem 4.11 of [3], that is, the strong algebraizability of GB (denoted by GBC in [7]), with the variety DM of De Morgan lattices as its equivalent algebraic semantics. And Theorem 4.98 of [7] states the non-algebraizability of GBC , which is proved from the strong algebraizability of GBC ; sin... Four-valued Logic,De Morgan http://biblioteca.universia.net/ficha.do?id=47319613 Abstract. bb We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a method consisting in the generation of the set of prime implicates of the original theory, starting from its set of countermodels (in the logic of Here-and-There), in a similar vein to the Quine-McCluskey method for minimisation of boolean functions. As a side result, we also provide several results about fund... Pedro Cabalar; David Pearce; Agustín Valverde http://biblioteca.universia.net/ficha.do?id=406941 In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some normal forms for derivations that are not available in the sequent calculus. Identity axiom, cut, weakening and also contraction can be reduced to atomic form. This leads to rules that are local: they do not require the inspection of expressions of unbounde... Bruennler, Kai http://biblioteca.universia.net/ficha.do?id=42036523 We describe the connections between the primitives of Combinatory Logic and operations in natural language syntax. We also show how word order variation in Turkish syntax can be explained by a few primitives of Combinatory Logic. A computational framework for Turkish syntax for parsing surface structures into combinator expressions is outlined. Evaluation of combinator expressions (semantic forms) has been shown to be similar to interpreting functional programming languages. Cem Bozsahin