• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 134
  • 34
  • 8
  • 6
  • 4
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 246
  • 246
  • 82
  • 50
  • 40
  • 37
  • 36
  • 33
  • 29
  • 28
  • 27
  • 26
  • 23
  • 23
  • 22
  • 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.

Towards next generation logic programming systems /

Bansal, Ajay, January 2007 (has links)
Thesis (Ph.D.)--University of Texas at Dallas, 2007. / Includes vita. Includes bibliographical references (leaves 105-110)

Sequentialization of logic programs /

Treitel, Richard James. January 1900 (has links)
Thesis (Ph. D.)--Stanford University, 1986. / "September 1986." "This work was partially supported by the Office of Naval Research under contracts number N00014-81-K-0303 and N00014-81-K-0004, by the National Institutes of Health under grant number 5P41 RR 00785, and by the Defense Advanced Research Projects Agency under contract number N00039-86-C-0033"--P. vi. Bibliography: p. 160-167.

The Clausal Theory of Types

Wolfram, David Anthony January 1990 (has links)
No description available.

Approaches to procedural adequacy in logic programming using connection graphs

Moens, Theodore Warren Bernelot January 1987 (has links)
Kowalski's connection graph method provides a representation for logic programs which allows for the incorporation of better procedural control techniques than standard logic programming languages. A proposed search strategy for visual recognition which combines top-down and bottom-up techniques has been incorporated in a connection graph implementation. The connection graph representation also allows for the natural incorporation of constraint satisfaction techniques in logic programming. Kowalski's approach to incorporating constraint satisfaction techniques in connection graphs is examined in detail. It is shown that his approach is not efficient enough to be used as a general preprocessing algorithm but that a modified version may be of use. Increased control of search and the incorporation of consistency techniques increase the procedural adequacy of logic programs for representing knowledge without compromising the descriptive capacity of the form. / Science, Faculty of / Computer Science, Department of / Graduate

Abduction by deduction

Fung, Tze Ho January 1996 (has links)
No description available.

Agent theories and architectures

Seel, Nigel January 1989 (has links)
Cognitive Science attempts to study entities which in some sense possess beliefs, intentions, desires etc. The preferred term in this thesis for such entities is agents. An attempt at a scientific analysis of agents however throws up a number of questions. What are the right concepts to describe agents? What kinds of formal notations permit perspicuous reasoning about agents? What can be said about the architecture and construction of agents? The introductory section of this thesis discusses these questions in some detail, using Dennett's ideas about intentional systems [Den87] as a point of departure. I then examine a number of studies from Artificial Intelligence, Logic, Natural Language semantics and Philosophy which give shape to the current state of the art in agent theory. This leads to the development of a mathematical model of multi-object/agent interaction, which I call the SRS-model (SRS - Synchronous Reactive Systems). I demonstrate the adequacy of the model by using it to formalise learning and games scenarios. Next, various logics are introduced which capture input-output and then belief-desire level descriptions of agents. These logics are given an SRS-model semantics, and adequacy is shown by modelling a psychological experiment (an agent in a Skinner Box). It is shown how the example can be formally analysed in terms of mechanisms and architecture at the SRS-level (including a computer simulation); at the level of behaviourism (using a temporal logic - APTL); and at an intentional level (using an epistemic-conative temporal logic ECTL). Some remarks are made about extending the analysis to multi-agent situations involving co-operation, competition and dialogue. Finally, a detailed survey is made of the main mathematical and logical resources available to the style of formal cognitive science advocated in this thesis. I include modal logic, including its epistemic and doxastic variants; the extension of modal logic to dynamic logic; and the various approaches recently developed in the logic of time.

Gazing : a technique for controlling the use of rewrite rules

Plummer, David John January 1988 (has links)
No description available.

Logic and objects : language, application and implementation

McCabe, Francis Gregory Christopher January 1989 (has links)
No description available.

Integrity constraints in deductive databases

Das, Subrata Kumar January 1990 (has links)
No description available.

Implementation of committed choice logic languages on shared memory multiprocessors

Crammond, James Alexander January 1988 (has links)
No description available.

Page generated in 0.1427 seconds