Global ETD Search

11	Over-constrained systems in CLP and CSP Jampel, Michael Benjamin January 1996 (has links) No description available. 005 Logic programming
12	And-parallel implementation of Prolog on distributed memory machines Verden, Andrew Roy January 1991 (has links) No description available. 005 Logic programming
13	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. 005 Logic programming
14	A representation language based on a game-theoretic interpretation of logic Jackson, E. P. January 1987 (has links) No description available. 519.5 Logic programming
15	Constraint-based reasoning in artificial intelligence Li, Bai January 1994 (has links) No description available. 003.5 Logic programming
16	Parallel execution of Parlog Cheese, Andrew B. January 1990 (has links) No description available. 005 Logic programming
17	IKBS for real-time monitoring and control applications Pokkunuri, Bhanu Prasad January 1990 (has links) No description available. 005 Logic programming
18	The Clausal Theory of Types Wolfram, David Anthony January 1990 (has links) No description available. 005 Logic programming
19	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 Connections (Mathematics) Logic programming
20	Abduction by deduction Fung, Tze Ho January 1996 (has links) No description available. 005 Logic programming

Search results