Results 11  20
of
132
The Garden of Knowledge as a Knowledge Manifold  A Conceptual Framework for Computer Supported Subjective Education
 CID17, TRITANAD9708, DEPARTMENT OF NUMERICAL ANALYSIS AND COMPUTING SCIENCE
, 1997
"... This work presents a unied patternbased epistemological framework, called a Knowledge Manifold, for the description and extraction of knowledge from information. Within this framework it also presents the metaphor of the Garden Of Knowledge as a constructive example. Any type of KM is defined in te ..."
Abstract

Cited by 28 (18 self)
 Add to MetaCart
This work presents a unied patternbased epistemological framework, called a Knowledge Manifold, for the description and extraction of knowledge from information. Within this framework it also presents the metaphor of the Garden Of Knowledge as a constructive example. Any type of KM is defined in terms of its objective calibration protocols  procedures that are implemented on top of the participating subjective knowledgepatches. They are the procedures of agreement and obedience that characterize the coherence of any type of interaction, and which are used here in order to formalize the concept of participator consciousness in terms of the inversedirect limit duality of Category Theory.
Developing Theories of Types and Computability via Realizability
, 2000
"... We investigate the development of theories of types and computability via realizability. ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
We investigate the development of theories of types and computability via realizability.
A Relational Approach To Optimization Problems
, 1996
"... The main contribution of this thesis is a study of the dynamic programming and greedy strategies for solving combinatorial optimization problems. The study is carried out in the context of a calculus of relations, and generalises previous work by using a loop operator in the imperative programming s ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
of problems and solutions that is a mixture of old and new. Another contribution is the invention of a new calculus, called the graph calculus, which is a useful tool for reasoning in the relational calculus and other nonrelational calculi. The graph
Normal forms for binary relations
, 2006
"... We consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly normalizi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly
Normal forms for binary relations
"... We consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly normalizi ..."
Abstract
 Add to MetaCart
We consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly
Between Functions and Relations in Calculating Programs
, 1992
"... This thesis is about the calculational approach to programming, in which one derives programs from specifications. One such calculational paradigm is Ruby, the relational calculus developed by Jones and Sheeran for describing and designing circuits. We identify two shortcomings with derivations made ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
This thesis is about the calculational approach to programming, in which one derives programs from specifications. One such calculational paradigm is Ruby, the relational calculus developed by Jones and Sheeran for describing and designing circuits. We identify two shortcomings with derivations made using Ruby. The first is that the notion of a program being an implementation of a specification has never been made precise. The second is to do with types. Fundamental to the use of type information in deriving programs is the idea of having types as special kinds of programs. In Ruby, types are partial equivalence relations (pers). Unfortunately, manipulating some formulae involving types has proved difficult within Ruby. In particular, the preconditions of the `induction' laws that are much used within program derivation often work out to be assertions about types; such assertions have typically been verified either by informal arguments or by using predicate calculus, rather than by ap...
Metaphor in Diagrams
 Darwin College, Univ. of Cambridge
, 1998
"... Modern computer systems routinely present information to the user as a combination of text and diagrammatic images, described as "graphical user interfaces". Practitioners and researchers in HumanComputer Interaction (HCI) generally believe that the value of these diagrammatic representat ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
Modern computer systems routinely present information to the user as a combination of text and diagrammatic images, described as "graphical user interfaces". Practitioners and researchers in HumanComputer Interaction (HCI) generally believe that the value of these diagrammatic representations is derived from metaphorical reasoning; they communicate abstract information by depicting a physical situation from which the abstractions can be inferred. This assumption has been prevalent in HCI research for over 20 years, but has seldom been tested experimentally. This thesis analyses the reasons why diagrams are believed to assist with abstract reasoning. It then presents the results of a series of experiments testing the contribution of metaphor to comprehension, problem solving, explanation and memory tasks carried out using a range of different diagrams. The results indicate that explicit metaphors provide surprisingly little benefit for cognitive tasks using diagrams as an external re...
Twisted Systems
, 1999
"... Let J be a shape in some category Shp for which there is a functor : Shp Cat. A categorical transition system (or system) is a pair (J; (J) C) consisting of a shape labelled by a functor in a category in C. Suitable choices for Shp include categories of partial orders, graphs, higherdimensional ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Let J be a shape in some category Shp for which there is a functor : Shp Cat. A categorical transition system (or system) is a pair (J; (J) C) consisting of a shape labelled by a functor in a category in C. Suitable choices for Shp include categories of partial orders, graphs, higher
Results 11  20
of
132