Allen P. Courtney

Learn More
The aim of this paper is to describe the algorithmic foundations of the part of the program Exten responsible for the computation of extensions in Constrained Default Logic. Exten is a system that computes extensions for various default logics. The eeciency of the system is increased by pruning techniques for the search tree. We motivate and present these(More)
In a recent paper Jun Arima formalises the idea of preduc-tion { a non-monotonic schema providing a common basis for inductive and analogical reasoning. We examine some of the implications of this schema, as well as its connections with prototypes and conceptual spaces. A generalised version of his schema is motivated and developed to address diiculties(More)
Default logic [3] is a useful formalism for reasoning with incomplete information, its intuitive characteristics making it particularly suited for applications. Ex-ten is a system currently capable of computing first-order Reiter, Justified and Constrained default extensions. It is part of a project to create a full default logic workbench, with future work(More)
  • 1