domingo 16 de febrero de 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 > (1102) Lógica deductiva
(1102.01) Analogía (1102.02) Álgebra de Boole
(1102.03) Lógica formal (1102.04) Lenguajes formalizados
(1102.05) Sistemas formales (1102.06) Fundamentos de matemáticas
(1102.07) Generalización (1102.08) Lógica matemática
(1102.09) Lógica modal (1102.10) Teoría de modelos
(1102.11) Teoría de pruebas (1102.12) Cálculo proposicional
(1102.13) Funciones recursivas (1102.14) Lógica simbólica
(1102.15) Teoría de lenguajes formales (1102.99) Otras (especificar)

Mostrando recursos 1 - 20 de 784

1. Elementary lessons in logic: deductive and inductive, with copious questions and examples, and a vocabulary of logical terms, by W. Stanley Jevons. - Jevons, William Stanley, 1835-1882.
New ed.

2. The elements of deductive logic, designed mainly for the use of junior students in the universities, by Thomas Fowler. - Fowler, Thomas, 1832-1904.
6th ed., cor. and rev.

3. Logic Programs for Intelligent Web Search - Bernd Thomas
We present a general framework for information extraction from web pages based on a special wrapper language, called token-templates. By using token-templates in conjunction with logic programs we are able to reason about web page contents, search and collect facts and derive new facts from various web pages. We give a formal definition for the semantics of logic programs extended by token-templates and define a general answer-complete calculus for these extended programs. These methods and techniques are used to build intelligent mediators and web information systems. Keywords: intelligent information systems; intelligent information retrieval; WWW; information extraction; template based wrappers; mediators;...

4. Transformation Systems at NASA Ames - Wray Buntine; Bernd Fischer; Klaus Havelund; Michael Lowry; Tom Pressburger; Steve Roach; Peter Robinson; Jeffrey Van Baalen; Adams State College
In this paper, we describe the experiences of the Automated Software Engineering Group at the NASA Ames Research Center in the development and application of three different transformation systems. The systems span the entire technology range, from deductive synthesis, to logic-based transformation, to almost compiler-like source-to-source transformation. These systems also span a range of NASA applications, including solving solar system geometry problems, generating data analysis software, and analyzing multithreaded Java code. Keywords deductive synthesis, source-to-source transformation, rewriting, compilation 1 INTRODUCTION In this paper, we describe the experiences of the Automated Software Engineering Group at the NASA Ames Research Center in...

5. Declarative Languages - Paradigm of the Past or Challenge of the Future? - Rainer Manthey
Declarative database query languages have recently been criticized by the research community. Proponents of database programming languages and object-oriented databases recommended doing away with declarative means for specifying retrieval, except for perhaps ad-hoc querying. Supporters of deductive databases and logic programming want to extend declarative query languages into full programming languages while retaining declarativity. It is our conviction that neither approach will lead to a satisfactory solution. We claim instead that languages offering both paradigms in full extension are desirable and can be achieved without suffering from the drawbacks encountered when simply combining existing query and programming languages. In this...

6. F.: Linear Logical Algorithms - Robert J. Simmons; Frank Pfenning
Abstract. Bottom-up logic programming can be used to declaratively specify many algorithms in a succinct and natural way, and McAllester and Ganzinger have shown that it is possible to define a cost semantics that enables reasoning about the running time of algorithms written as inference rules. Previous work with the programming language Lollimon demonstrates the expressive power of logic programming with linear logic in describing algorithms that have imperative elements or that must repeatedly make mutually exclusive choices. In this paper, we identify a bottom-up logic programming language based on linear logic that is amenable to efficient execution and describe...

7. What is the Normative Role of Logic?
Abstract: The paper tries to spell out a connection between deductive logic and rationality, against Harman’s arguments that there is no such connection, and also against the thought that any such connection would preclude rational change in logic. One might not need to connect logic to rationality if one could view logic as the science of what preserves truth by a certain kind of necessity (or, by necessity plus logical form); but the paper points out a serious obstacle to any such view. What is the connection between (deductive) logic and rationality? Answers to this vary markedly. At one extreme...

8. Computational Science JASA June Computational Articles Code Publicly Available - Victoria Stodden
2011 29 of 29 21 % My own experience our group at Stanford practiced “really reproducible research” inspired by Stanford Professor Jon Claerbout: “The idea is: An article about computational science in a scientific publication is not the scholarship itself, it is merely advertising of the scholarship. The actual scholarship is the complete software development environment and the complete set of instructions which generated the figures. ” David Donoho, 1998. Example: Sparselab (2006) Updating the Scientific Method Donoho and others argue that computation presents only a potential third branch of the scientific method:- Branch 1 (deductive): mathematics, formal logic,- Branch...

9. Computational Science JASA June Computational Articles Code Publicly Available - Victoria Stodden
Generally, data and code not available at publication, insufficient information captured in the publication for verification, replication. My own experience our group at Stanford practiced “really reproducible research” inspired by Stanford Professor Jon Claerbout: “The idea is: An article about computational science in a scientific publication is not the scholarship itself, it is merely advertising of the scholarship. The actual scholarship is the complete software development environment and the complete set of instructions which generated the figures. ” David Donoho, 1998. Example: Sparselab (2006) Updating the Scientific Method Donoho and others argue that computation presents only a potential third branch...

10. Computational Science JASA June Computational Articles Code Publicly Available - Victoria Stodden
2011 29 of 29 21 % My own experience our group at Stanford practiced “really reproducible research” inspired by Stanford Professor Jon Claerbout: “The idea is: An article about computational science in a scientific publication is not the scholarship itself, it is merely advertising of the scholarship. The actual scholarship is the complete software development environment and the complete set of instructions which generated the figures. ” David Donoho, 1998. Example: Sparselab (2006) Updating the Scientific Method Donoho and others argue that computation presents only a potential third branch of the scientific method:- Branch 1 (deductive): mathematics, formal logic,- Branch...

11. NYSPI Biostatistics Seminar Series - Victoria Stodden
Central to the Scientific Enterprise 1.enormous, and increasing, amounts of data collection, • ~3TB/yr genome sequence data: ~1000 sequencers running full time producing 600GB each run (HiSeq 2000, 11 days per run), • CMS project at LHC: 300 “events ” per second, 5.2M seconds of runtime per year,.5MB per event = 780TB/yr => several PB when data processed, • Sloan Digital Sky Survey: 8th data release (2010), 49.5TB. 2.massive simulations of the complete evolution of a physical system, systematically varying parameters, 3.deep intellectual contributions now encoded in software. Tuesday, September 20, 2011Updating the Scientific Method Donoho and others have argued...

12. International Chinese Statistical Association Symposium - Victoria Stodden
Central to the Scientific Enterprise • enormous, and increasing, amounts of data collection,- ~3TB/yr genome sequence data: ~1000 sequencers running full time producing 600GB each run (HiSeq 2000, 11 days per run),- CMS project at LHC: 300 “events ” per second, 5.2M seconds of runtime per year,.5MB per event = 780TB/yr => several PB when data processed,- Sloan Digital Sky Survey: 8th data release (2010), 49.5TB. • massive simulations of the complete evolution of a physical, systematically varying parameters, • deep intellectual contributions now encoded in software. Updating the Scientific Method Many have argued (Gray) that data-driven discovery, engenders a...

13. Scientific Endeavor JASA June Computational Articles Code Publicly Available - Victoria Stodden
• Data and code typically not made available at the time of scientific publication, rendering results unverifiable, not reproducible. ➡ A Credibility CrisisComputational Methods Emerging as Central to the Scientific Enterprise 1.enormous, and increasing, amounts of data collection, • ~3TB/yr genome sequence data: ~1000 sequencers running full time producing 600GB each run (HiSeq 2000, 11 days per run), • CMS project at LHC: 300 “events ” per second, 5.2M seconds of runtime per year,.5MB per event = 780TB/yr => several PB when data processed, • Sloan Digital Sky Survey: 8th data release (2010), 49.5TB. 2.massive simulations of the complete evolution...

14. Tools for Academic Research: Resolving the Credibility Crisis in Computational Science - Victoria Stodden
5.Tools to facilitate scientific communication 6.Giving credit for contributions in the digital age 7.Brave New World: Challenges to Open ScienceComputational Methods Emerging as Central to the Scientific Enterprise • enormous, and increasing, amounts of data collection,- ~3TB/yr genome sequence data: ~1000 sequencers running full time producing 600GB each run (HiSeq 2000, 11 days per run),- CMS project at LHC: 300 “events ” per second, 5.2M seconds of runtime per year,.5MB per event = 780TB/yr => several PB when data processed,- Sloan Digital Sky Survey: 8th data release (2010), 49.5TB. • massive simulations of the complete evolution of a physical system,...

15. What is Reproducible Research? The Practice of Science Today and the Scientific Method - Victoria Stodden
Central to the Scientific Enterprise 1.enormous, and increasing, amounts of data collection, • ~3TB/yr genome sequence data: ~1000 sequencers running full time producing 600GB each run (HiSeq 2000, 11 days per run), • CMS project at LHC: 300 “events ” per second, 5.2M seconds of runtime per year,.5MB per event = 780TB/yr => several PB when data processed, • Sloan Digital Sky Survey: 8th data release (2010), 49.5TB. 2.massive simulations of the complete evolution of a physical system, systematically varying parameters, 3.deep intellectual contributions now encoded in software. Updating the Scientific Method Donoho and others have argued that computation presents...

16. Temporal Deductive Verification of Basic ASM Models - Hocine El-habib Daho; Djillali Benhamamouch
Abstract. Abstract State Machines (ASMs, for short) provide a practical new computational model which has been applied in the area of software engineering for systems design and analysis. However, reasoning about ASM models occurs, not within a formal deductive system, but basically in the classical informal proofs style of mathematics. Several formal verification approaches for proving correctness of ASM models have been investigated. In this paper we consider the use of the TLA + logic for the deductive verification of a certain class of ASMs, namely basic ASMs which have successfully been applied in describing the dynamic behavior of systems...

17. Difusos (fuzzy set theory) - Sobrino, José Carlos
La teoría clásica de conjuntos precisa en sus construcciones lógicas y en sus reglas deductivas no recoge aquellos fenómenos reales cuyas características son "imprecisas" o "difusas". En la esfera de los predicados subjetivos, y por tanto imprecisos, la teoría de conjuntos se enfrenta a un obstáculo difícil de superar. ¿ Cómo podríamos definir el conjunto formado por las personas "altas" de una determinada reunión? ¿Desde que altura se empieza a ser "alto"? La teoría de subconjuntos difusos pretende eliminar los obstáculos habituales para la teoría de conjuntos y reclama para sí un cuerpo de doctrina cuya incidencia en las diversas...

18. Matrix Determinant as a Verifier of a Path (cycle) in the Directed Hamiltonian Cycle Problem under Two Special Conditions: A Formal Proof - O. B. Okunoye
In earlier work, the author conjectured that under two special conditions relating to theorems on the determinant of a matrix: the absence of a zero row (column) and the absence of similar rows (columns), a non-zero determinant value certifies the existence of a Directed Hamiltonian Path in an arbitrary adjacency matrix. Here, a formal proof is provided by means of deductive logic to establish that in an arbitrary adjacency matrix of size n (n rows and n columns), a non-zero determinant value verifies the existence of a Directed Hamiltonian Path in the adjacency matrix.

19. Extending Classical Logic with Inductive Definitions - Marc Denecker
The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of non-monotonic reasoning, logic programming and deductive databases, and to show its application for knowledge representation by giving a typology of definitional knowledge.

20. A Comparison of the Static and the Disjunctive Well-founded Semantics and its Implementation - Stefan Brass; Jürgen Dix; Ilkka Niemela; Teodor C. Przymusinski
In recent years, much work was devoted to the study of theoretical foundations of Disjunctive Logic Programs and Disjunctive Deductive Databases. While the semantics of non-disjunctive programs is fairly well understood the declarative and computational foundations of disjunctive programming proved to be much more elusive and difficult. Recently, two new and very promising semantics have been proposed for the class of disjunctive logic programs. Both of them extend the wellfounded semantics of normal programs. The first one is the static semantics proposed by Przymusinski and the other is the disjunctive wellfounded semantics proposed by Brass and Dix. Although the two...

Página de resultados:
 

Busque un recurso