Mostrando recursos 1 - 20 de 2.450

  1. Temporary Read-Only Permissions for Separation Logic

    Charguéraud, Arthur; Pottier, François
    We present an extension of Separation Logic with a general mechanism for temporarily converting any assertion (or "permission") to a read-only form. No accounting is required: our read-only permissions can be freely duplicated and discarded. We argue that, in circumstances where mutable data structures are temporarily accessed only for reading, our read-only permissions enable more concise specifications and proofs. The metatheory of our proposal is verified in Coq.

  2. La capacitación como estrategia de desarrollo turístico para las comunidades: Caso Centro Shuar Tsuer Entsa, Naranjal

    Torres Quiroga, Sergio Javier; Barreth, Alba Caicedo
    En la presente investigación se buscó diagnosticar la situación turística en el Centro Shuar Tsuer Entsa, y el progreso de los habitantes shuaras en esta actividad. Este estudio de carácter cualitativo, bajo los métodos lógico y analítico, se analizó el problema desde la conclusión general del comportamiento organizativo, social y económico de los pobladores locales. El objetivo general consistió en formular una estrategia de desarrollo turístico para los habitantes del centro Shuar Tsuer Entsa que sirva para impulsar el turismo sustentable en el lugar. Lo cual antepuso la hipótesis de la preparación de los prestadores de servicio en temas turísticos...

  3. En defensa del argumento finitista

    Tajer, Diego
    In this paper, I analyze the main replies that have been given to Etchemendy's (1990) finitist argument, and I show that none of them is successful. First, I describe and criticize the proposals that try to solve the problem by appealing to modal considerations. These solutions fail because they presuppose a very weak finitism, where the existence of infinitely many sets, or possible words with infinitely many objects, is accepted. But there are stronger versions of finitism that reintroduce the problem. Then I consider the solutions which appeal to semantical categories. One of them incorrectly categorizes the problem as a...

  4. La fenomenología del don y la dialéctica entre disimetría y mutualidad

    Walton, Roberto J.
    RESUMEN: El artículo procura, en primer lugar, esbozar los rasgos fundamentales de la mutualidad del don tal como han sido presentados por P. Ricoeur en Parcours de la reconnaissance. En segundo lugar, se intenta esclarecer el carácter simbólico del don ceremonial recíproco aplicando los rasgos distintivos asignados por Ricoeur al simbolismo inmanente o constructivo. En tercer lugar, se analiza la así llamada economía del don en el terreno del simbolismo representativo con la finalidad de mostrar la función crítica ejercida por el agape sobre la lógica de la equivalencia. Finalmente, se examina el marco general del análisis de Ricoeur sobre...

  5. Predicação e extensão conceitual em Kant: problemas

    Fonseca, Renato Duarte
    The article examines Kant's notion of conceptual extension in order to determine a conception of predication that could integrate, in a coherent fashion, basic theoretical commitments of general logic as he conceived it and the central tenets of his transcendental logic. After a brief overview of the several characterizations of thatnotion in the Kantian corpus, I distinguish three interpretative models concerning it in the literature. Such models are criticized and their prospects of integrating Kant's commitments in a fully satisfactory way are rejected. Finally, I sketch an alternative account of Kant's notion of conceptual extension, which respects the criteria of...

  6. La comunicación institucional en las redes sociales digitales on line. Análisis de un caso

    Lucrecia Gandolfo, María
    En las últimas décadas Internet ha generado transformaciones en la manera de habitar el mundo que han impactado notablemente en el campo de la comunicación. En este informe se presentarán las indagaciones y la aproximación a las conclusiones realizadas en un trabajo de investigación becado por la Comisión de Investigaciones Científicas de la Provincia de Buenos Aires, en el que se aborda cómo dichas modificaciones han generado nuevas lógicas de significación social en la comunicación institucional. El crecimiento de una de las aplicaciones de la web 2.0, las redes sociales digitales on line, en tanto nuevas media­ciones simbólicas, desafía a...

  7. Perspectivas en ciencia y tecnología de la lógica difusa

    González A., Carlos A.
    La necesidad de manejar información incierta y vaga se encuentra presente prácticamente en cualquier fenómeno, ya sea éste natural, social, económico, etc. Una de las formas de atacar este problema es mediante la utilización de lógicas no clásicas, es decir, lógicas que pueden contar con diferentes grados de verdad, como por ejemplo, la lógica difusa. En este artículo se hará una introducción general al mundo de la lógica difusa y sus repercusiones actuales en el campo de la ciencia y de la tecnología. Este trabajo sirve como introducción al resto de los artículos publicados en este mismo número. Previamente, haremos...

  8. La distribution: un enjeu pour la filière construction

    Bellet, Michel; Thomas, Jean-Noël
    The crisis has been modifying the situation of the building materials distribution within the building connection: a larger autonomy for the wholesaler, a larger part for the end-user, the apparition of some do-it-yourself hypermarket. This trend is now visible in the markets structures as well as in the financial structures. So, the second start of the activity implies reorganizing the structure of the distribution, with new theories about the parts and goals of distribution within the connection. This article purpose is to focus three distinct logics of the distribution within the actual mutations: an "interindustrial" logic, a "general public" logic...

  9. Learning Commonalities in RDF and SPARQL

    El Hassad, Sara; Goasdoué, François; Jaudoin, Hélène
    Finding commonalities between descriptions of data or knowledge is a fundamental task in Machine Learning. The formal notion characterizing precisely such commonalities is known as least general generalization of descriptions and was introduced by G. Plotkin in the early 70's, in First Order Logic. Identifying least general generalizations has a large scope of database applications ranging from query optimization (e.g., to share commonalities between queries in view selection or multi-query optimization) to recommendation in social networks (e.g., to establish connections between users based on their commonalities between profiles or searches). To the best of our knowledge, this is the first...

  10. An Iterative Abstraction Algorithm for Reactive Correct-by-Construction Controller Synthesis

    Mattila, Robert; Mo, Yilin; Murray, Richard M.
    In this paper, we consider the problem of synthesizing correct-by-construction controllers for discrete-time dynamical systems. A commonly adopted approach in the literature is to abstract the dynamical system into a Finite Transition System (FTS) and thus convert the problem into a two player game between the environment and the system on the FTS. The controller design problem can then be solved using synthesis tools for general linear temporal logic or generalized reactivity(1) specifications. In this article, we propose a new abstraction algorithm. Instead of generating a single FTS to represent the system, we generate two FTSs, which are under- and...

  11. Justificación a priori y conocimiento básico: el caso de la lógica

    García Arnaldos, María Dolores
    El objeto de esta tesis es analizar la cuestión de la justificación del conocimiento lógico básico. Argumentaremos que la solución inferencialista a dicho problema de Boghossian no resulta del todo satisfactoria, mientras que una teoría alternativa de justificación no-inferencial a partir de la consideración de una noción de justificación más débil o ‘habilitación’ (entitlement), permite hablar de conocimiento básico evitando caer en una regresión al infinito. La noción de garantía racional dentro de un proyecto cognitivo de Wright, ofrece una solución viable tanto para el conocimiento básico en general, como para el caso particular de la lógica. Señalamos que el...

  12. Similarity-based unification: a multi-adjoint approach. Fuzzy sets and systems

    Jesús Medina; Manuel Ojeda-aciego
    The aim of this paper is to build a formal model for fuzzy unification in multi-adjoint logic programs containing both a declarative and a procedural part, and prove its soundness and completeness. Our approach is based on a general framework for logic programming, which gives a formal model of fuzzy logic programming extended by fuzzy similarities and axioms of first-order logic with equality.

  13. Distribution of ammonia in cells and plasma

    F. L. Humoller; A. J. Barak; J. M. Hoithaus
    A method for the determination of plasma and whole blood ammonia is outlined which incorporates the desirable features of several older methods. By means of this method it has been demonstrated that the distribution of ammonia in erythrocytes and plasma of normal individuals is nearly equal to that of hydrogen ions. The ratio remains con-stant in cirrhosis, alkalemia, and ammonemia. It was observed in 82 consecutive admissions of cirrhotic patients that alkalemia was present in only a small percentage of the cases. IN THE COURSE of an investigatiomi in the field of ammonia metabolism it became of interest to determine...

  14. The Lindenbaum algebra of the theory of the class of all finite models

    Reed Solomon
    In this paper, we investigate the Lindenbaum algebra L(Tfin) of the theory Tfin = Th(Mfin) of the class Mfin of all finite models of a finite rich signature. We prove that this algebra is an atomic Boolean algebra while its Gödel numeration γ is a Π 0 1-numeration. Moreover, the quotient algebra � � L(Tfin)/F, γ/F 0 modulo the Fréchet ideal F is a Σ2-algebra, which is universal over the class of all Σ 0 2 Boolean algebras. These conditions characterize uniquely the algebra L(Tfin); moreover, these con-ditions characterize up to recursive isomorphism the numerated Boolean quotient algebra � �...

  15. A first approach to Abductive Defeasible Logic Programming: formalization and properties

    Mauro J. Gómez Lucero Alej
    This article presents the confluence of two general ideas: Defeasible Logic Programming (DeLP, an argu-mentation based formalism for representing knowledge and reasoning) and Abduction in logic. In first place, we introduce a framework that formally states the problem of doing abduction (obtaining abductive explana-tions) in the particular case that the abductive theory is a DeLP Program. In the reminder of this work we face that problem, providing a formal characterization of the notion of abductive explanation, in such a way that we could then easily calculate the explanations from this formal characterization. An important advantage of this approach is that...

  16. In

    F. J. M. Teusink; Frank Teusink
    email frankt cwinl There is a growing interest in ways to represent incomplete information in logic programs It has been shown that limited forms of abduction can be used quite elegantly for this purpose In this paper we propose a three valued completion semantics for abductive logic programs which solves some problems associated with Console et als twovalued completion semantics The semantics is a generalization of Kunens completion semantics for general logic programs which is known to correspond very well to a class of eective proof procedures for general logic programs Secondly we propose a proof procedure for abductive logic...

  17. Least general generalizations in RDF and SPARQL

    El Hassad, Sara; Goasdoué, François; Jaudoin, Hélène
    Finding commonalities between descriptions of data or knowledge is a fundamental task in Machine Learning. The formal notion characterizing precisely such commonalities is known as least general generalization of descriptions and was introduced by G. Plotkin in the early 70's, in First Order Logic. Identifying least general generalizations has a large scope of database applications ranging from query optimization (e.g., to share commonalities between queries in view selection or multi-query optimization) to recommendation in social networks (e.g., to establish connections between users based on their commonalities between profiles or searches). To the best of our knowledge, this is the first...

  18. Encoding a Dependent-Type Lambda-Calculus in a Logic Programming Language

    Felty, Amy; Miller, Dale
    Various forms of typed λ-calculi have been proposed as specification languages for representing wide varieties of object logics. The logical framework, LF, is an example of such a dependent-type λ-calculus. A small subset of intuitionistic logic with quantification over simply typed λ-calculus has also been proposed as a framework for specifying general logics. The logic of hereditary Harrop formulas with quantification at all non-predicate types, denoted here as hhω, is such a meta-logic that has been implemented in both the Isabelle theorem prover and the λProlog logic programming language. Both frameworks provide for specifications of logics in which details involved...

  19. Step-Indexed Normalization for a Language with General Recursion

    Cainghino, Chris; Sjoberg, Vilhelm; Weirich, Stephanie
    The TRELLYS project has produced several designs for practical dependently typed languages. These languages are broken into two fragments—a logical fragment where every term normalizes and which is consistent when interpreted as a logic, and a programmatic fragment with general recursion and other convenient but unsound features. In this paper, we present a small example language in this style. Our design allows the programmer to explicitly mention and pass information between the two fragments. We show that this feature substantially complicates the metatheory and present a new technique, combining the traditional Girard–Tait method with step-indexed logical relations, which we use...

  20. Declarative debugging

    Caballero Roldán, Rafael
    Declarative debugging is a debugging technique that abstracts the execution details to focus on the semantic meaning of the program components. It was frst proposed in the feld of Logic Programming, but its general structure has been later extended to other programming paradigms, becoming an active area of research. The technique relies on a data structure, the computation tree, that represents some computation producing an unexpected result. This tree is traversed by asking questions to the user about the correction of the intermediate computation steps until the source of the bug has been found. We show how instances of this...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.