Global ETD Search

1	Finite default theories Etherington, David William January 1982 (has links) The thesis presents a survey of formalisms for non-monotonic reasoning, providing a sketch of the "state of the art" in the field. Reiter's logic for default reasoning is discussed in detail. Following this, a procedure which can determine the extensions of general finite default theories is demonstrated. The potential impact of this procedure on some of the other research in the field is explored, and some promising areas for future research are indicated. Grounds for cautious optimism about the tractability of default theories capable of representing a wide variety of common situations are presented. / Science, Faculty of / Computer Science, Department of / Graduate Logic, Symbolic and mathematical Default theories
2	Default reasoning and neural networks Govender, I. (Irene) 06 1900 (has links) In this dissertation a formalisation of nonmonotonic reasoning, namely Default logic, is discussed. A proof theory for default logic and a variant of Default logic - Prioritised Default logic - is presented. We also pursue an investigation into the relationship between default reasoning and making inferences in a neural network. The inference problem shifts from the logical problem in Default logic to the optimisation problem in neural networks, in which maximum consistency is aimed at The inference is realised as an adaptation process that identifies and resolves conflicts between existing knowledge about the relevant world and external information. Knowledge and data are transformed into constraint equations and the nodes in the network represent propositions and constraint equations. The violation of constraints is formulated in terms of an energy function. The Hopfield network is shown to be suitable for modelling optimisation problems and default reasoning. / Computer Science / M.Sc. (Computer Science) Default logic Normal default theories Resolution theorem proving Neural networks Penalty logic Hopfield network training algorithm Nonmonotonic inferences Expectations Connectionist Inference mechanism Conflict resolution strategies 006.32 Non-monotonic logic Default logic Neural networks (Computer science) Nonmonotonic reasoning
3	Default reasoning and neural networks Govender, I. (Irene) 06 1900 (has links) In this dissertation a formalisation of nonmonotonic reasoning, namely Default logic, is discussed. A proof theory for default logic and a variant of Default logic - Prioritised Default logic - is presented. We also pursue an investigation into the relationship between default reasoning and making inferences in a neural network. The inference problem shifts from the logical problem in Default logic to the optimisation problem in neural networks, in which maximum consistency is aimed at The inference is realised as an adaptation process that identifies and resolves conflicts between existing knowledge about the relevant world and external information. Knowledge and data are transformed into constraint equations and the nodes in the network represent propositions and constraint equations. The violation of constraints is formulated in terms of an energy function. The Hopfield network is shown to be suitable for modelling optimisation problems and default reasoning. / Computer Science / M.Sc. (Computer Science) Default logic Normal default theories Resolution theorem proving Neural networks Penalty logic Hopfield network training algorithm Nonmonotonic inferences Expectations Connectionist Inference mechanism Conflict resolution strategies 006.32 Non-monotonic logic Default logic Neural networks (Computer science) Nonmonotonic reasoning

1

Page generated in 0.0663 seconds