Results 1  10
of
77
Algebraic Decision Diagrams and their Applications
, 1993
"... In this paper we present theory and experiments on the Algebraic Decision Diagrams (ADD's). These diagrams extend BDD's by allowing values from an arbitrary finite domain to be associated with the terminal nodes. We present a treatment founded in boolean algebras and discuss algorithms and ..."
Abstract

Cited by 316 (17 self)
 Add to MetaCart
In this paper we present theory and experiments on the Algebraic Decision Diagrams (ADD's). These diagrams extend BDD's by allowing values from an arbitrary finite domain to be associated with the terminal nodes. We present a treatment founded in boolean algebras and discuss algorithms and results in applications like matrix multiplication and shortest path algorithms. Furthermore, we outline possible applications of ADD's to logic synthesis, formal verification, and testing of digital systems.
Two Classes of Boolean Functions for Dependency Analysis
 SCIENCE OF COMPUTER PROGRAMMING
, 1994
"... Many static analyses for declarative programming/database languages use Boolean functions to express dependencies among variables or argument positions. Examples include groundness analysis, arguably the most important analysis for logic programs, finiteness analysis and functional dependency analys ..."
Abstract

Cited by 76 (4 self)
 Add to MetaCart
Many static analyses for declarative programming/database languages use Boolean functions to express dependencies among variables or argument positions. Examples include groundness analysis, arguably the most important analysis for logic programs, finiteness analysis and functional dependency analysis for databases. We identify two classes of Boolean functions that have been used: positive and definite functions, and we systematically investigate these classes and their efficient implementation for dependency analyses. On the theoretical side we provide syntactic characterizations and study the expressiveness and algebraic properties of the classes. In particular, we show that both are closed under existential quantification. On the practical side we investigate various representations for the classes based on reduced ordered binary decision diagrams (ROBDDs), disjunctive normal form, conjunctive normal form, Blake canonical form, dual Blake canonical form, and two forms specific to de...
Symmetry Detection and Dynamic Variable Ordering of Decision Diagrams
, 1996
"... Knowing that some variables are symmetric in a function has numerous applications; in particular, it can help produce better variable orders for Binary Decision Diagrams (BDDs) and related data structures (e.g., Algebraic Decision Diagrams). It has been observed that there often exists an optimum ..."
Abstract

Cited by 65 (2 self)
 Add to MetaCart
(Show Context)
Knowing that some variables are symmetric in a function has numerous applications; in particular, it can help produce better variable orders for Binary Decision Diagrams (BDDs) and related data structures (e.g., Algebraic Decision Diagrams). It has been observed that there often exists an optimum order for a BDD wherein symmetric variables are contiguous. We propose a new algorithm for the detection of symmetries, based on dynamic reordering, and we study its interaction with the reordering algorithm itself. We show that combining sifting with an efficient symmetry check for contiguous variables results in the fastest symmetry detection algorithm reported to date and produces better variable orders for many BDDs. The overhead on the sifting algorithm is negligible. 1
General Conditions for the Decomposition of State Holding Elements
 In International Symposium on Advanced Research in Asynchronous Circuits and Systems, Aizu
, 1996
"... A fundamental problem in the design of speedindependent asynchronous circuits is the decomposition or splitting up of highfanin operators into two or more lowerfanin operators. In this paper, we develop general techniques to decided whether a particular decomposition of an arbitrary stateholding ..."
Abstract

Cited by 33 (4 self)
 Add to MetaCart
(Show Context)
A fundamental problem in the design of speedindependent asynchronous circuits is the decomposition or splitting up of highfanin operators into two or more lowerfanin operators. In this paper, we develop general techniques to decided whether a particular decomposition of an arbitrary stateholding or combinational element into two elements with an isolated internal signal is correct. These techniques are extended to determine efficiently all legal decompositions in a parameterized family. 1 Introduction In this paper, we derive general conditions on the legality of decompositions in speedindependent circuits. The primary motivation for this work is the desire to implement asynchronous circuits generated using the Martin's synthesis methodology [8] in fixed fanin structures such as the Montage field programmable gate array [6]. The work described here differs significantly from previous work on the decomposition problem [1, 10]. Instead of performing decompositions into particular st...
Semantic Forgetting in Answer Set Programming
, 2008
"... The notion of forgetting, also known as variable elimination, has been investigated extensively in the context of classical logic, but less so in (nonmonotonic) logic programming and nonmonotonic reasoning. The few approaches that exist are based on syntactic modifications of a program at hand. In t ..."
Abstract

Cited by 30 (11 self)
 Add to MetaCart
(Show Context)
The notion of forgetting, also known as variable elimination, has been investigated extensively in the context of classical logic, but less so in (nonmonotonic) logic programming and nonmonotonic reasoning. The few approaches that exist are based on syntactic modifications of a program at hand. In this paper, we establish a declarative theory of forgetting for disjunctive logic programs under answer set semantics that is fully based on semantic grounds. The suitability of this theory is justified by a number of desirable properties. In particular, one of our results shows that our notion of forgetting can be entirely captured by classical forgetting. We present several algorithms for computing a representation of the result of forgetting, and provide a characterization of the computational complexity of reasoning from a logic program under forgetting. As applications of our approach, we present a fairly general framework for resolving conflicts in inconsistent knowledge bases that are represented by disjunctive logic programs, and we show how the semantics of inheritance logic programs and update logic programs from the literature can be characterized through forgetting. The basic idea of the conflict resolution framework is to weaken the preferences of each agent by forgetting certain knowledge that causes inconsistency. In particular, we show how to use the notion of forgetting to provide an elegant solution for preference elicitation in disjunctive logic programming.
Logic synthesis for lookup table based FPGAs using functional decomposition and support minimization
 In Proc. ICCAD
, 1995
"... This paper presents a logic synthesis method for lookup table (LUT) based eld programmable gate arrays (FPGAs). We determine functions to be mapped to LUTs by functional decomposition. We use not only disjunctive decomposition but also nondisjunctive decomposition. Furthermore, we propose a new B ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
(Show Context)
This paper presents a logic synthesis method for lookup table (LUT) based eld programmable gate arrays (FPGAs). We determine functions to be mapped to LUTs by functional decomposition. We use not only disjunctive decomposition but also nondisjunctive decomposition. Furthermore, we propose a new Boolean resubstitution technique customized for an LUT network synthesis. Resubstitution is used to determine whether an existing function is useful to realize another function; thus, we can share the common function among two or more functions. The Boolean resubstitution is eectively carried out by solving a support minimization problem for an incompletely specied function. We can also handle satisability don't cares of an LUT network using the technique. 1
Negative Boolean Constraints
, 1994
"... Systems of Boolean constraints which allow negative constraints such as f 6` g are investigated. The results form a basis for algorithms to determine satisfiability, validity, implication, equivalence and variable elimination for such systems. These algorithms have applications in spatial query deco ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
Systems of Boolean constraints which allow negative constraints such as f 6` g are investigated. The results form a basis for algorithms to determine satisfiability, validity, implication, equivalence and variable elimination for such systems. These algorithms have applications in spatial query decomposition, machine reasoning, and constraint logic programming. Proofs of the results rely on independence of inequations, which enables results for systems with a single inequation to be lifted to systems with many inequations. 1 Introduction Since Boole [2], systems (or conjunctions) of positive constraints f ` g over a Boolean algebra have been extensively studied. Here, we introduce and study a more general notion of Boolean constraint system in which negative Boolean constraints f 6` g are also allowed. Systems of positive and negative constraints have not yet been widely studied in their own right. This may be because in the case of twovalued Boolean algebras, negative constraints ad...
Structural Methods for the Synthesis of SpeedIndependent Circuits
, 1996
"... Most existing tools for the synthesis of asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper presents novel methods exclusively based on the structural analysis of the underlying Petri net. This methodology can be ..."
Abstract

Cited by 20 (10 self)
 Add to MetaCart
Most existing tools for the synthesis of asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper presents novel methods exclusively based on the structural analysis of the underlying Petri net. This methodology can be applied to any STG that can be covered by State Machines and, in particular, to all live and safe freechoice STGs. Significant improvements with regard to existing structural methods are provided. The new techniques have been implemented in an experimental tool that has been able to synthesize specificationswith over10 27 markings, some of them being nonfree choice. 1 Introduction Petri nets (PNs) are a powerful formalism to model concurrent systems. As a model, their most interesting feature is the capability of implicitly describing a vast state space by a succinct representation, which gracefully captures the notions of causality, concurrency and conflict between events. Petri nets...