• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2528
  • 1006
  • 246
  • 206
  • 205
  • 186
  • 76
  • 52
  • 40
  • 40
  • 40
  • 40
  • 40
  • 39
  • 28
  • Tagged with
  • 5576
  • 1507
  • 719
  • 659
  • 497
  • 484
  • 422
  • 388
  • 376
  • 366
  • 365
  • 357
  • 355
  • 352
  • 341
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
81

The theory of inconsistency: inconsistant mathematics and paraconsistent logic/ C. E. Mortensen.

Mortensen, Chris. January 2005 (has links)
Each volume includes author's previously published papers. / Bibliography: leaves 147-151 (v. 1). / 3 v. : / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (D.Sc.)--University of Adelaide, School of Mathematical Sciences, 2005
82

An actualist ontology for counterfactuals

Peñafuerte, Araceli Sandil. January 2008 (has links)
Thesis (Ph. D.)--University of California, San Diego, 2008. / Title from first page of PDF file (viewed December 5, 2008). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 160-164).
83

Lower-top and upper-bottom points for any formula in temporal logic/

Baysal, Onur. Alizde, Rarail January 2006 (has links) (PDF)
Thesis (Master)--İzmir Institute of Technology, İzmir, 2006 / Keywords:Temporal logic, modal logic. Includes bibliographical references (leaves 45).
84

The effects of linguistic and psychosocial factors on children's logical performance /

Kwock, Myunghi Synn January 1984 (has links)
No description available.
85

Using Extended Logic Programs to Formalize Commonsense Reasoning

Horng, Wen-Bing 05 1900 (has links)
In this dissertation, we investigate how commonsense reasoning can be formalized by using extended logic programs. In this investigation, we first use extended logic programs to formalize inheritance hierarchies with exceptions by adopting McCarthy's simple abnormality formalism to express uncertain knowledge. In our representation, not only credulous reasoning can be performed but also the ambiguity-blocking inheritance and the ambiguity-propagating inheritance in skeptical reasoning are simulated. In response to the anomalous extension problem, we explore and discover that the intuition underlying commonsense reasoning is a kind of forward reasoning. The unidirectional nature of this reasoning is applied by many reformulations of the Yale shooting problem to exclude the undesired conclusion. We then identify defeasible conclusions in our representation based on the syntax of extended logic programs. A similar idea is also applied to other formalizations of commonsense reasoning to achieve such a purpose.
86

Logics of Formal Inconsistency / Lógicas da Inconsistência Formal

Almeida, João Marcos de, 1974- January 2005 (has links)
According to the classical consistency presupposition, contradictions have an explosive character: Whenever they are present in a theory, anything goes, and no sensible reasoning can thus take place. A logic is paraconsistent if it disallows such presupposition, and allows instead for some inconsistent yet non-trivial theories to make perfect sense. The Logics of Formal Inconsistency, LFIs, form a particularly expressive class of paraconsistent logics in which the metatheoretical notion of consistency can be internalized at the object-language level. As a consequence, the LFIs are able to recapture consistent reasoning by the addition of appropriate consistency assumptions. The present monograph introduces the LFIs and provides several illustrations of them and of their properties, showing that such logics constitute in fact the majority of interesting paraconsistent systems in the literature. Several ways of performing the recapture of consistent reasoning inside such inconsistent systems are also illustrated. In each case, interpretations in terms of many-valued, possible-translations, or modal semantics are provided, and the problems related to providing algebraic counterparts to such logics are surveyed. A formal abstract approach is proposed to all related definitions and an extended investigation is made into the logical principles and the positive and negative properties of negation.
87

A design methodology for the implementation of fuzzy logic traffic controller using programmable gate array /

Ambre, Mandar. Kwan, Bing Woon, January 2004 (has links)
Thesis (M.S.)--Florida State University, 2004. / Advisor: Dr. Bing Kwan, Florida State University, College of Engineering, Dept. of Electrical and Computer Engineering. Title and description from dissertation home page (viewed June 16, 2004). Includes bibliographical references.
88

Monadic bounded algebras : a thesis submitted to the Victoria University of Wellington in fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics /

Akishev, Galym. January 2009 (has links)
Thesis (Ph.D.)--Victoria University of Wellington, 2009. / Includes bibliographical references and index.
89

Logic for children within a play paradigm /

Howe, Karin January 2006 (has links)
Thesis (All-College Honors) - - State University of New York College at Cortland, 2006 - - Department of Philosophy.
90

An axiom system for a spatial logic with convexity

Trybus, Adam January 2012 (has links)
A spatial logic is any formal language with geometric interpretation. Research on region-based spatial logics, where variables are set to range over certain subsets of geometric space, have been investigated recently within the qualitative spatial reasoning paradigm in AI. We axiomatised the theory of (ROQ(R 2), conv, ≤) , where ROQ(R 2) is the set of regular open rational polygons of the real plane; conv is the convexity property and ≤ is the inclusion relation. We proved soundness and completeness theorems. We also proved several expressiveness results. Additionally, we provide a historical and philosophical overview of the topic and present contemporary results relating to affine spatial logics.

Page generated in 0.042 seconds