Results 1  10
of
3,673
Symbolic Boolean manipulation with ordered binarydecision diagrams
 ACM COMPUTING SURVEYS
, 1992
"... Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as grap ..."
Abstract

Cited by 1036 (13 self)
 Add to MetaCart
Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented
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 804 (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
A Semantic Analysis of Inference Involving Venn Diagrams SunJoo Shin
, 1992
"... My thesis, Valid Reasoning and Visual Representation (1991), challenges general prejudice ag ainst visualization in the history of logic and mathematics by providing a semantic analysis of two graphical representation systems a traditional Venn diagram representation system and an extension of it. ..."
Abstract
 Add to MetaCart
My thesis, Valid Reasoning and Visual Representation (1991), challenges general prejudice ag ainst visualization in the history of logic and mathematics by providing a semantic analysis of two graphical representation systems a traditional Venn diagram representation system and an extension of it
Efficient implementation of a BDD package
 In Proceedings of the 27th ACM/IEEE conference on Design autamation
, 1991
"... Efficient manipulation of Boolean functions is an important component of many computeraided design tasks. This paper describes a package for manipulating Boolean functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based on an efficient implementat ..."
Abstract

Cited by 504 (9 self)
 Add to MetaCart
Efficient manipulation of Boolean functions is an important component of many computeraided design tasks. This paper describes a package for manipulating Boolean functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based on an efficient
Computing with Membranes
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1998
"... We introduce a new computability model, of a distributed parallel type, based on the notion of a membrane structure. Such a structure consists of several celllike membranes, recurrently placed inside a unique "skin" membrane. A plane representation is a Venn diagram without intersected se ..."
Abstract

Cited by 441 (5 self)
 Add to MetaCart
We introduce a new computability model, of a distributed parallel type, based on the notion of a membrane structure. Such a structure consists of several celllike membranes, recurrently placed inside a unique "skin" membrane. A plane representation is a Venn diagram without intersected
Tarskis World; Venn Diagrams
"... People find difficulty in performing syllogistic reasoning. This paper outlines some reasons for poor syllogistic reasoning. Representational systems (RS) used in presenting and evaluating syllogisms can be distinguished in terms of attributes such as specificity, expressiveness, and abstraction. Gr ..."
Abstract
 Add to MetaCart
. Graphical RSs have pedagogical potential because of their expressivity and specificity attributes. The paper looks at four different graphical RSs for supporting syllogistic reasoning: Venn diagrams, Euler circles, Stennings Euler circles, and Tarski's World (TW). Each is described in terms of those
Algebraic Generalization1 of Venn Diagram
"... It is easy to deal with a Venn Diagram for 1 ≤ n ≤ 3 sets. When n gets larger, the picture becomes more complicated, that's why we thought at the following codification. That’s why we propose an easy and systematic algebraic way of dealing with the representation of intersections and unions of ..."
Abstract
 Add to MetaCart
It is easy to deal with a Venn Diagram for 1 ≤ n ≤ 3 sets. When n gets larger, the picture becomes more complicated, that's why we thought at the following codification. That’s why we propose an easy and systematic algebraic way of dealing with the representation of intersections and unions
Algebraic Generalization 1 of Venn Diagram
"... It is easy to deal with a Venn Diagram for 1 ≤ n ≤ 3 sets. When n gets larger, the picture becomes more complicated, that's why we thought at the following codification. That’s why we propose an easy and systematic algebraic way of dealing with the representation of intersections and unions of ..."
Abstract
 Add to MetaCart
It is easy to deal with a Venn Diagram for 1 ≤ n ≤ 3 sets. When n gets larger, the picture becomes more complicated, that's why we thought at the following codification. That’s why we propose an easy and systematic algebraic way of dealing with the representation of intersections and unions
External Cognition: How do Graphical Representations Work?
 INTERNATIONAL JOURNAL OF HUMANCOMPUTER STUDIES
, 1996
"... Advances in graphical technology have now made it possible for us to interact with information in innovative ways, most notably by exploring multimedia environments and by manipulating threedimensional virtual worlds. Many benefits have been claimed for this new kind of interactivity, a general ass ..."
Abstract

Cited by 341 (27 self)
 Add to MetaCart
assumption being that learning and cognitive processing are facilitated. We point out, however, that little is known about the cognitive value of any graphical representations, be they good oldfashioned (e.g. diagrams) or more advanced (e.g. animations, multimedia, virtual reality). In our paper, we
State Transition Analysis: A RuleBased Intrusion Detection Approach
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 1995
"... This paper presents a new approach to representing and detecting computer penetrations in realtime. The approach, called state transition analysis, models penetrations as a series of state changes that lead from an initial secure state to a target compromised state. State transition diagrams, the g ..."
Abstract

Cited by 353 (19 self)
 Add to MetaCart
, the graphical representation of penetrations, identify precisely the requirements for and the compromise of a penetration and present only the critical events that must occur for the successful completion of the penetration. State transition diagrams are written to correspond to the states of an actual computer
Results 1  10
of
3,673