• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 8,073
Next 10 →

Symbolic Boolean manipulation with ordered binary-decision diagrams

by Randal E Bryant - ACM COMPUTING SURVEYS , 1992
"... Ordered Binary-Decision 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 Binary-Decision 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

Learning Ordered Binary Decision Diagrams

by Ricard Gavalda, David Guijarro, Pau Gargallo - In 6th International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence No. 997, Jantke, Shinohara, Zeugmann (Eds , 1995
"... This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ..."
Abstract - Cited by 11 (0 self) - Add to MetaCart
This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a

Ordered Binary Decision Diagrams and the Davis-Putnam Procedure

by Tomás E. Uribe, Mark E. Stickel - IN PROC. OF THE 1ST INTERNATIONAL CONFERENCE ON CONSTRAINTS IN COMPUTATIONAL LOGICS , 1994
"... We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicate that the Davis-Putnam procedure outperforms obdds in hard constraint-satisfaction problems, while obdds are clearly superior for ..."
Abstract - Cited by 51 (1 self) - Add to MetaCart
We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicate that the Davis-Putnam procedure outperforms obdds in hard constraint-satisfaction problems, while obdds are clearly superior

Terminological Reasoning in SHIQ with Ordered Binary Decision Diagrams

by Sebastian Rudolph, Markus Krötzsch, Pascal Hitzler - In Proceedings of the 23rd AAAI Conference on Artficial Intelligence (AAAI-08
"... We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent fragment of the Web Ontology Language OWL. The algorithm is based on ordered binary decision diagrams (OBDDs) as a datastructure for storing and operating on large model representations. We thus draw ..."
Abstract - Cited by 12 (7 self) - Add to MetaCart
We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent fragment of the Web Ontology Language OWL. The algorithm is based on ordered binary decision diagrams (OBDDs) as a datastructure for storing and operating on large model representations. We thus draw

Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams

by Franco Raimondi, Alessio Lomuscio - Journal of Applied Logic
"... checking via ordered binary decision diagrams ..."
Abstract - Cited by 53 (27 self) - Add to MetaCart
checking via ordered binary decision diagrams

Composition of Reduced Ordered Binary Decision Diagrams

by Elena Dubrova
"... A widely accepted opinion is that, under a certain ordering restriction, the class of Reduced Ordered Binary Decision Diagrams (ROBDDs) is closed under composition. However, in this paper we show that this is not correct. We formulate necessary and sufficient conditions for the composition of two RO ..."
Abstract - Add to MetaCart
A widely accepted opinion is that, under a certain ordering restriction, the class of Reduced Ordered Binary Decision Diagrams (ROBDDs) is closed under composition. However, in this paper we show that this is not correct. We formulate necessary and sufficient conditions for the composition of two

Ordered Binary Decision Diagrams and the Shannon Effect

by Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav , 2003
"... We investigate the size and structure of ordered binary decision diagrams (OBDDs) for random Boolean functions. It was known that for most values of n, the expected OBDD size of a random Boolean function with n variables is equal to the worst-case size up to terms of lower order. Such a phenomenon i ..."
Abstract - Add to MetaCart
We investigate the size and structure of ordered binary decision diagrams (OBDDs) for random Boolean functions. It was known that for most values of n, the expected OBDD size of a random Boolean function with n variables is equal to the worst-case size up to terms of lower order. Such a phenomenon

Secure Function Evaluation with Ordered Binary Decision Diagrams

by Louis Kruger, Somesh Jha, et al. , 2006
"... Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptographic primitive for designing privacy-preserving protocols is secure function evaluation (SFE). The classic solution for ..."
Abstract - Cited by 23 (1 self) - Add to MetaCart
-based representation called ordered binary decision diagrams (OBDDs). For a large number of Boolean functions, OBDDs are more succinct than the gate-based representation. Preliminary experimental results based on a prototype implementation shows that for several functions, our protocol results in a smaller bandwidth

Ordered Binary Decision Diagrams as Knowledge-Bases

by Takashi Horiyama, Toshihide Ibaraki - Artificial Intelligence , 1999
"... . We propose to make use of ordered binary decision diagrams (OBDDs) as a means of realizing knowledge-bases. We show that the OBDD-based representation is more ecient and suitable in some cases, compared with the traditional CNF-based and/or model-based representations from the view point of spa ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
. We propose to make use of ordered binary decision diagrams (OBDDs) as a means of realizing knowledge-bases. We show that the OBDD-based representation is more ecient and suitable in some cases, compared with the traditional CNF-based and/or model-based representations from the view point

Using Ordered Binary-Decision Diagrams for Compressing Images and Image Sequences

by Mike Starkey, Randy Bryant, Y Bryant , 1995
"... The Ordered Binary-Decision Diagram (OBDD) has been used to reduce the amount of space and computation required for verifying digital circuits by removing redundant copies of subfunctions. Similarly, image compression algorithms attempt to reduce their space requirements by finding replicated patter ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
The Ordered Binary-Decision Diagram (OBDD) has been used to reduce the amount of space and computation required for verifying digital circuits by removing redundant copies of subfunctions. Similarly, image compression algorithms attempt to reduce their space requirements by finding replicated
Next 10 →
Results 1 - 10 of 8,073
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University