Friday, August 22, 2014

 

 



Soy un nuevo usuario

Olvidé mi contraseña

Entrada usuarios

Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida
Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía
Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía
Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía
 

rss_1.0 Clasificación por Disciplina

Nomenclatura Unesco > (11) Lógica > (1103) Lógica general

Mostrando recursos 1 - 20 de 1,863

1. A cut-free proof theory for Boolean BI (via display logic) - James Brotherston
We give a display calculus proof system for Boolean BI (BBI) based on Belnap’s general display logic. We show that cut-elimination holds in our system and that it is sound and complete with respect to the usual notion of validity for BBI. We then show how to constrain proof search in the system (without loss of generality) by means of a series of proof transformations. By doing so, we gain some insight into the problem of decidability for BBI.

2. Solving logic program conflicts through strong and weak forgettings - Yan Zhang; Norman Y. Foo , et al.
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from this program in some way, and other atoms related to them in the program might also be affected. We define notions of strong and weak forgettings in logic programs to capture such intuition and reveal their close connections to the notion of forgetting in classical propositional theories. Based on these notions, we then propose a framework for conflict solving in logic programs, which is general enough...

3. Complexity of First Order ID-Logic - John S. Schlipf; Marc Denecker
First Order ID-Logic interprets general first order, nonmonotone, inductive definability by generalizing the wellfounded semantics for logic programs. We show that, for general (thus perhaps infinite) structures, inference in First Order ID-Logic is complete Π 1 2 over the natural numbers. We also prove a Skolem Theorem for the logic: every consistent formula of First Order ID-Logic has a countable model.

4. Russia’s Economic Strategy - Ye. Gavrilenkov
The general logic of the strategy for the country’s development in the 21 st century arises from the following postulates: • The Russian economy is part of the global economy. In the 1990s the extent of Russia’s involvement in global economic processes grew significantly, and this occurred, first and foremost, as a result of the formation and development of the Russian private sector. Indeed, it was at the level of the private sector and among certain segments of the population that Russia began to resemble the rest of the world in economic and cultural respects, even if this did express...

5. Elements of philosophy : comprising logic and ontology or general metaphysics / - Hill, Walter H. (Walter Henry), 1822-1907.
Includes bibliographical references and index.

6. La estructura lógica de la teoría general de keynes : una crítica de benetti - Vroey, Michel de; Méndez, Carolina; Cataño, José Félix

7. La estructura lógica de la teoría general de keynes - Benetti, Carlo; Cataño, José Félix

8. La prensa clandestina: un estudio de caso sobre el PRT-ERP - Santilli, Sandra
This investigation, explores the graphic production manufactured and published by the members of the Revolutionary Party of the Workers (Partido Revolucionario de los Trabajadores, PRT) and the Revolutionary Army of the People (Ejército Revolucionario del Pueblo, ERP). It studies the communicative strategies that this Argentinean agrupation had between the years 1968 and 1977, period marked by strong social tensions and political radicalizations. To problematize its parity labor on a communicative way has as an objective to demonstrate of what way, the phenomenon of the clandestine press, put in evidence the argumentations that were the support and backup of a political...

9. A Visual Approach to Multilinear Recursion - Tiziana Catarci; Giuseppe Santucci
The problem of expressing complex queries in a friendly way is particularly relevant due to the growing diffusion of databases. However, the most significant proposals for extending the expressive power of the relational query languages are based on the logical paradigm. In particular, an extension of the Horn clause queries, i.e. the so-called stratified Datalog, yields stratified queries, that are a proper subset of fixpoint queries. It is a general opinion that logic is not a friendly interfacing medium for a casual user. As a consequence, other types of query languages, i.e. visual query languages, have been proposed, some of...

10. Solving hard industrial combinatorial problems with SAT - Abío Roig, Ignasi
The topic of this thesis is the development of SAT-based techniques and tools for solving industrial combinatorial problems. First, it describes the architecture of state-of-the-art SAT and SMT Solvers based on the classical DPLL procedure. These systems can be used as black boxes for solving combinatorial problems. However, sometimes we can increase their efficiency with slight modifications of the basic algorithm. Therefore, the study and development of techniques for adjusting SAT Solvers to specific combinatorial problems is the first goal of this thesis. Namely, SAT Solvers can only deal with propositional logic. For solving general combinatorial problems, two different approaches are...

11. Algebraic model theory for languages without equality - Elgueta Montó, Raimon
In our opinion, it is fair to distinguish two separate branches in the origins of model theory. The first one, the model theory of first-order logic, can be traced back to the pioneering work of L. Lowenheim, T. Skolem, K. Gödel, A. Tarski and A.I. MaI 'cev, published before the mid 30's. This branch was put forward during the 40s' and 50s’ by several authors, including A. Tarski, L. Henkin, A. Robinson, J. Los. Their contribution, however, was rather influenced by modern algebra, a discipline whose development was being truly fast at the time. Largely due to this influence, it...

12. Logic-based support for Ontology Development in Open Environments - Jiménez Ruiz, Ernesto
El sentido filosófico del término ontología hace referencia a la esencia misma del ser, a su existencia (onto=ser). Para un sistema inteligente lo que existe es lo que puede representarse. En informática una ontología se ha definido como una conceptualización formal y compartida de un dominio. Actualmente las ontologías tienen un rol clave en el desarrollo de laWeb Semántica, pero también están siendo usadas en otros dominios como la biomedicina, agricultura, defensa, robótica y astronomía.En la investigación llevada a cabo en esta tesis nos hemos centrado en el diseño y desarrollo de métodos generales y técnicas basadas en la lógica...

13. Ataques de seguridad en las FPGAs y cómo prevenirlos - López Echeverry, Ana María; Santa V., Jessica Andrea
Este documento es un estudio de algunos ataques de seguridad a los dispositivos lógicos de propósito general, concretamente a las FPGA (del inglés Field Programmable Gate Array), que se han encontrado. Actualmente es muy común escuchar hablar de este tipo de dispositivos, las FPGA´s y sus múltiples contextos de aplicación, entre los que se encuentran procesos de aceleración, criptografía, entre otros. Sin embargo, se desconocen los ataques que éstas pueden sufrir. Con este documento se pretende mostrar algunos de los ataques conocidos y algunas formas de prevenirlos.

14. Combining Coq and Gappa for Certifying Floating-Point Programs - Sylvie Boldo; Jean-christophe Filliâtre; Guillaume Melquiond
Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floating-point arithmetic, such as Gappa, but they target very restrictive logics. On the other hand, there are interactive theorem provers based on the LCF approach, such as Coq, that handle a general-purpose logic but that lack proof automation for floating-point properties. To alleviate these issues, we have implemented a mechanism for calling Gappa from a Coq interactive proof. This paper presents this combination and shows on several examples how this approach offers a significant speedup in the process of verifying floating-point programs.

15. Combining Coq and Gappa for Certifying Floating-Point Programs - Sylvie Boldo; Jean-christophe Filliâtre; Guillaume Melquiond
Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floating-point arithmetic, such as Gappa, but they target very restrictive logics. On the other hand, there are interactive theorem provers based on the LCF approach, such as Coq, that handle a general-purpose logic but that lack proof automation for floating-point properties. To alleviate these issues, we have implemented a mechanism for calling Gappa from a Coq interactive proof. This paper presents this combination and shows on several examples how this approach offers a significant speedup in the process of verifying floating-point programs.

16. CHR: A Flexible Query Language - Slim Abdennadher; Heribert Schütz
We show how the language CHR, a high-level logic language for the implementation of constraint solvers, can be slightly extended to become a general-purpose logic programming language with an expressive power subsuming the expressive power of Horn clause programs with SLD resolution. The extended language, called "CHR ", retains however the extra features of CHR, e.g., committed choice and matching, which are important for other purposes, especially for efficiently solving constraints. CHR turns out to be a very flexible query language since it supports several (constraint) logic programming paradigms and allows to mix them in a single program. In particular,...

17. ON THE PARALLEL COMPLEXITY OF ACYCLIC LOGIC PROGAMS - Shiva Chaudhuri; Yannis Dimopoulos; Christos D. Zaroliagis
In this paper we investigate the parallel complexity of computing the stable model of acyclic general logic programs. Within this class of logic programs, we consider the cases of negative and definite logic programs. Both cases are proved to be P-complete. We prove the same for a related problem, namely that of computing the kernel of a directed acyclic graph.

18. Boomborg-PC: A Proof-Checker of Calculus of Constructions Running on a Buffer of GNU Emacs - Masami Hagiya
Introduction Boomborg-PC is a proof-checker of Calculus of Constructions that runs on a buffer of GNU Emacs. Calculus of Constructions, proposed by Thierry Coquand and G'erard Huet [2], is one of the so-called higher-order typed -calculi [1]. A typed -calculus is a formal system for writing typed -terms, and Boomborg-PC is a program that typechecks -terms written by the rules of Calculus of Constructions. A typed -calculus is called higher-order, if it has variables ranging over types. Higher-order typed -calculi, including Calculus of Constructions, are also called general logic or logical framework, because they can be used as a general...

19. Los diversos sentidos de la negación y en particular de la lógica paraconsistente - Palau, Gladys
Es sabido que el problema del significado de las constantes lógicas es uno de los problemas fundamentales de la filosofía de la lógica y que el mismo ha sido respondido desde perspectivas sintácticas y semánticas. Según las primeras, las constantes lógicas adquieren significado por las reglas que rigen su uso lógico tal como lo expuso Gentzen en sus cálculos de deducción natural y, según las segundas, por las condiciones de verdad, generalmente basadas en el concepto de verdad caracterizado por Tarski . También es sabido que ambos enfoques coinciden por lo general en las constantes lógicas positivas pero no en...

20. Analysis of dialogical argumentation via finite state machines - Hunter, A
Dialogical argumentation is an important cognitive activity by which agents exchange arguments and counterarguments as part of some process such as discussion, debate, persuasion and negotiation. Whilst numerous formal systems have been proposed, there is a lack of frameworks for implementing and evaluating these proposals. First-order executable logic has been proposed as a general framework for specifying and analysing dialogical argumentation. In this paper, we investigate how we can implement systems for dialogical argumentation using propositional executable logic. Our approach is to present and evaluate an algorithm that generates a finite state machine that reflects a propositional executable logic specification...

Página de resultados:
 

Busque un recurso