1 
Focused inverse method for LFLi, Xi, January 1900 (has links)
Thesis (M.Sc.). / Written for the School of Computer Science. Title from title page of PDF (viewed 2008/05/14). Includes bibliographical references.

2 
Task Interaction and Control System (TICS) /Grossman, Mark, January 1987 (has links)
Thesis (Ph. D.)Oregon Graduate Center, 1987.

3 
Ordinaltheoretic properties of logic programsBagai, Rajiv 19 June 2018 (has links)
The work described in this dissertation is mainly a study of some ordinaltheoretic properties of logic programs that are related to the downward powers of their immediateconsequence functions. The downward powers for any program give rise to an interesting nonincreasing sequence of interpretations, whose point of convergence is called the downward closure ordinal of that program. The last appearance of ground atoms that get eliminated somewhere in this sequence is called their downward order.
While it is wellknown that there is no general procedure that can determine downward orders of atoms in any program, we present some rules for constructing such a procedure for a restricted class of programs.
Another existing result is that for every ordinal up to and including the least nonrecursive ordinal [special characters omitted] there is a logic program having that ordinal as its downward closure ordinal. However, the literature contains only a few examples of programs, constructed in an ad hoc manner, with downward closure ordinal greater than the least transfinite ordinal (ω). We contribute to bridging this wide gap between the abstract and concrete knowledge by showing the connection between some of the existing examples and the wellknown concept of the order of a vertex in a graph. Using this connection and a convenient notation system for ordinals involving ground terms as bases, we construct a family [special characters omitted] of logic programs where [special characters omitted] is the least fixpoint of the function λβ[ωβ] and any member Pα of the family has downward closure ordinal ω + α.
We also present an organization of a general transformation system, in which the objective is to search for transformations on syntax objects that satisfy preestablished semantic constraints. As desired transformations are not always guaranteed to exist, we present necessary and sufficient conditions for their existence. In this framework, we proceed to give transformations on logic programs for the successor and addition operations on their downward closure ordinals. / Graduate

4 
Limiting programs for induction in artificial intelligenceCaldon, Patrick , Computer Science & Engineering, Faculty of Engineering, UNSW January 2008 (has links)
This thesis examines a novel inductionbased framework for logic programming. Limiting programs are logic programs distinguished by two features, in general they contain an infinite data stream over which induction will be performed, and in general it is not possible for a system to know when a solution for any program is correct. These facts are characteristic of some problems involving induction in artificial intelligence, and several problems in knowledge representation and logic programming have exactly these properties. This thesis presents a specification language for problems with an inductive nature, limiting programs, and a resolution based system, limiting resolution, for solving these problems. This framework has properties which guarantee that the system will converge upon a particular answer in the limit. Solutions to problems which have such an inductive property by nature can be implemented using the language, and solved with the solver. For instance, many classification problems are inductive by nature. Some generalized planning problems also have the inductive property. For a class of generalized planning problems, we show that identifying a collection of domains where a plan reaches a goal is equivalent to producing a plan. This thesis gives examples of both. Limiting resolution works by a generateandtest strategy, creating a potential solution and iteratively looking for a contradiction with the growing stream of data provided. Limiting resolution can be implemented by modifying conventional PROLOG technology. The generateand test strategy has some inherent inefficiencies. Two improvements have arisen from this work; the first is a tabling strategy which records previously failed attempts to produce a solution and thereby avoids redundant test steps. The second is based on the heuristic observation that for some problems the size of the test step is proportional to the closeness of the generated potentialsolution to the real solution, in a suitable metric. The observation can be used to improve the performance of limiting resolution. Thus this thesis describes, from theoretical foundations to implementation, a coherent methodology for incorporating induction into existing general A.I. programming techniques, along with examples of how to perform such tasks.

5 
Higherorder functional languages and intensional logicRondogiannis, Panagiotis 10 April 2015 (has links)
Graduate

6 
Prolog and expert systemsDavies, Peter Leslie January 1987 (has links)
The first part of the thesis provides an introduction to the logic programming language Prolog and some areas of current research. The use of compilation to make Prolog faster and more efficient is studied and a modified representation for complex structures is presented. Two programming tools are also presented. The second part of the thesis focuses on one problem which arises when implementing an Expert System using Prolog. A practical threevalued Prolog implementation is described. An interpreter accepts threevalued formulae and converts these into a Prolog representation. Formulae are in clausal form which allows disjunctive conclusions to rules. True and false formulae are stated explicitly and therefore the interpreter is able to perform useful consistency checks when information is added to the data base.

7 
Protein sidechain placement using CLPSwain, Martin T. January 2001 (has links)
Constraint logic programming (CLP) techniques can be used in protein sidechain placement, an important subtask in comparative modelling. In a simple formulation values for domain variables represent rotamer sidechain conformations, and constraints represent atomic clashes. These constraints can be visualised using a "rotamer contact map", and observations made with this visualisation tool have been used to develop a strategy that overcomes limitations present in CLP caused by overconstrained residues. Null rotamers provide a mechanism that can automatically identify overconstrained residues. The use of null rotamers makes possible an iterative modelling strategy where, at each iteration, a CLP program is generated automatically; each program representing successively tighter packing constraints corresponding to larger atomic radii. Different CLP enumeration heuristics have been evaluated for use with this sidechain placement method, and it has been tested with several different rotamer libraries; a backbonedependent rotamer library, when used with firstfail enumeration heuristics, was shown to be the most successful. Sidechain conformations predicted by this CLP method compare favourably against those predicted using other sidechain placement methods. The CLP method has been applied to two modelling problems. The first involved building models of class II MHC molecules in order to increase the utility of a peptide threading program. This program uses an allele's known or modelled 3D structure with a heuristic scoring function to predict peptides that are likely to bind to it  thus using CLP to model class II MHC alleles increases the program's utility. The second application used the CLP method to build structures of ribosome inactivating proteins (RIPs). These models were built using CLP together with comparative modelling approaches, and a model of bouganin, a recently identified wild RIF protein, has been built to help design engineered therapeutic proteins.

8 
A message driven orparallel logic architectureDelgado Rannauro, Sergio A. January 1989 (has links)
No description available.

9 
Towards a semantics bridge between structured specifications and logicspecifications梁秉雄, Leung, Pinghung, Karl Richard. January 1992 (has links)
published_or_final_version / Computer Science / Master / Master of Philosophy

10 
A logicbased concurrent objectoriented programming languageMelendez, Rafael Ramirez January 1996 (has links)
No description available.

Page generated in 0.1114 seconds