• 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.

Over-constrained systems in CLP and CSP

Jampel, Michael Benjamin January 1996 (has links)
No description available.

And-parallel implementation of Prolog on distributed memory machines

Verden, Andrew Roy January 1991 (has links)
No description available.

A methodology and a tool for the formalisation and representation of 'common sense' (naive physical) knowledge

Cunningham, J. January 1985 (has links)
No description available.

A representation language based on a game-theoretic interpretation of logic

Jackson, E. P. January 1987 (has links)
No description available.

Constraint-based reasoning in artificial intelligence

Li, Bai January 1994 (has links)
No description available.

Parallel execution of Parlog

Cheese, Andrew B. January 1990 (has links)
No description available.

IKBS for real-time monitoring and control applications

Pokkunuri, Bhanu Prasad January 1990 (has links)
No description available.

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.

Page generated in 0.1667 seconds