Results 1  10
of
718,640
Spider diagrams: A diagrammatic reasoning system
 Journal of Visual Languages and Computing
, 2001
"... Spider diagrams combine and extend Venn diagrams and Euler circles to express constraints on sets and their relationships with other sets. These diagrams can be used in conjunction with objectoriented modelling notations such as the Unified Modeling Language. This paper summarises the main syntax a ..."
Abstract

Cited by 47 (12 self)
 Add to MetaCart
and semantics of spider diagrams. It also introduces inference rules for reasoning with spider diagrams and a rule for combining spider diagrams. This system is shown to be sound but not complete. Disjunctive diagrams are considered as one way of enriching the system to allow combination of diagrams so
Why a diagram is (sometimes) worth ten thousand words
 Cognitive Science
, 1987
"... We distinguish diagrammatic from sentential paperandpencil representationsof information by developing alternative models of informationprocessing systems that are informationally equivalent and that can be characterized as sentential or diagrammatic. Sentential representations are sequential, li ..."
Abstract

Cited by 777 (2 self)
 Add to MetaCart
We distinguish diagrammatic from sentential paperandpencil representationsof information by developing alternative models of informationprocessing systems that are informationally equivalent and that can be characterized as sentential or diagrammatic. Sentential representations are sequential
Spider diagrams
"... The use of diagrams in mathematics has traditionally been restricted to guiding intuition and communication. With rare exceptions such as Peirce’s α and β systems, purely diagrammatic formal reasoning has not been in the mathematicians or logicians toolkit. This paper develops a purely diagrammatic ..."
Abstract

Cited by 89 (33 self)
 Add to MetaCart
reasoning system of ‘spider diagrams ’ that builds on Euler, Venn and Peirce diagrams. The system is known to be expressively equivalent to first order monadic logic with equality. We develop two levels of diagrammatic syntax: an ‘abstract ’ syntax that captures the structure of diagrams and a ‘concrete
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 543 (11 self)
 Add to MetaCart
are given, one that constructs the Voronoi diagram in O(n log n) time, and another that inserts a new site in O(n) time. Both are based on the use of the Voronoi dual, or Delaunay triangulation, and are simple enough to be of practical value. The simplicity of both algorithms can be attributed
Speedith: a diagrammatic reasoner for spider diagrams
"... Abstract. In this paper, we introduce Speedith which is a diagrammatic theorem prover for the language of spider diagrams. Spider diagrams are a wellknown logic for which there is a sound and complete set of inference rules. Speedith provides a way to input diagrams, transform them via the diagramm ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. In this paper, we introduce Speedith which is a diagrammatic theorem prover for the language of spider diagrams. Spider diagrams are a wellknown logic for which there is a sound and complete set of inference rules. Speedith provides a way to input diagrams, transform them via
Statecharts: A Visual Formalism For Complex Systems
, 1987
"... We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discreteevent systems, such as multicomputer realtime systems, communication protocols and digital control units. Our diagrams, which we cal ..."
Abstract

Cited by 2683 (56 self)
 Add to MetaCart
We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discreteevent systems, such as multicomputer realtime systems, communication protocols and digital control units. Our diagrams, which we
Plans And ResourceBounded Practical Reasoning
 COMPUTATIONAL INTELLIGENCE, 4(4):349355, 1988
, 1988
"... An architecture for a rational agent must allow for meansend reasoning, for the weighing of competing alternatives, and for interactions between these two forms of reasoning. Such an architecture must also address the problem of resource boundedness. We sketch a solution of the first problem that p ..."
Abstract

Cited by 485 (19 self)
 Add to MetaCart
An architecture for a rational agent must allow for meansend reasoning, for the weighing of competing alternatives, and for interactions between these two forms of reasoning. Such an architecture must also address the problem of resource boundedness. We sketch a solution of the first problem
VisualSEEk: a fully automated contentbased image query system
, 1996
"... 1 We describe a highly functional prototype system for searching by visual features in an image database. The VisualSEEk system is novel in that the user forms the queries by diagramming spatial arrangements of color regions. The system finds the images that contain the most similar arrangements of ..."
Abstract

Cited by 752 (31 self)
 Add to MetaCart
1 We describe a highly functional prototype system for searching by visual features in an image database. The VisualSEEk system is novel in that the user forms the queries by diagramming spatial arrangements of color regions. The system finds the images that contain the most similar arrangements
A Field Study of the Software Design Process for Large Systems
 Communications of the ACM
, 1988
"... The problems of designing large software systems were studied through interviewing personnel from 17 large projects. A layered behavioral model is used to analyze how three lgf these problemsthe thin spread of application domain knowledge, fluctuating and conflicting requirements, and communication ..."
Abstract

Cited by 663 (2 self)
 Add to MetaCart
The problems of designing large software systems were studied through interviewing personnel from 17 large projects. A layered behavioral model is used to analyze how three lgf these problemsthe thin spread of application domain knowledge, fluctuating and conflicting requirements
Results 1  10
of
718,640