Graph-Based Algorithms for Boolean Function Manipulation
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Verified AIG algorithms in ACL2
- Truncating abstraction of bit-vector operations for BDD-based SMT solvers
- Extended formulations via decision diagrams
- Boosting optimal symbolic planning: operator-potential heuristics
- Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores
- Learning differentiable logic programs for abstract visual reasoning
- Be lazy and don't care: faster CTL model checking for recursive state machines
- Optimal ordered binary decision diagrams for read-once formulas
- A note on the size of OBDDs for the graph of integer multiplication
- An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints
- Ordered binary decision diagrams and the Davis-Putnam procedure
- The formal-CAFE methodology and model checking patterns in the specification of e-commerce systems
- State based control of timed discrete event systems using binary decision diagrams
- BDD-based symbolic model checking
- Propositional SAT solving
- A moderately exponential time algorithm for k-IBDD satisfiability
- Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
- Parity OBDDs cannot be handled efficiently enough
- On the computational power of linearly transformed BDDs
- Worst case examples for operations on OBDDs
- Fast computation of bounds for two-terminal network reliability
- Compositional reasoning in model checking
- Synthesizing efficient systems in probabilistic environments
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- Running time experiments on some algorithms for solving propositional satisfiability problems
- Implementing relational specifications in a constraint functional logic language
- A probabilistic logic programming event calculus
- Equivalence checking 40 years after: a review of bisimulation tools
- Weak, strong, and strong cyclic planning via symbolic model checking
- Strategy Graphs for Influence Diagrams
- On the upper bounds for complexities of discrete functions
- On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
- On the error resilience of ordered binary decision diagrams
- scientific article; zbMATH DE number 1424030 (Why is no real title available?)
- Compositional SCC analysis for language emptiness
- Verification and enforcement of access control policies
- scientific article; zbMATH DE number 1324661 (Why is no real title available?)
- On random orderings of variables for parity ordered binary decision diagrams
- DD: a new decision diagram for efficient problem solving in permutation space
- Solving bitvectors with MCSAT: explanations from bits and pieces
- A fast symbolic transformation based algorithm for reversible logic synthesis
- Factorization using binary decision diagrams
- Automated formal analysis and verification: an overview
- Deciding effectively propositional logic using DPLL and substitution sets
- Partially unate Boolean functions: properties of their sum-of-products representations
- scientific article; zbMATH DE number 4096781 (Why is no real title available?)
- Modeling for Verification
- Logic programs as compact denotations.
- scientific article; zbMATH DE number 1796128 (Why is no real title available?)
- Property preserving abstractions for the verification of concurrent systems
- Model checking temporal properties of reaction systems
- Learning from interpretation transition
- \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
- Towards the hierarchical verification of reactive systems
- String-matching with OBDDs
- Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications
- An information statistics approach to data stream and communication complexity
- Using variable-entered karnaugh maps to solve boolean equations
- Translation among CNFs, characteristic models and ordered binary decision diagrams
- Formal verification based on Boolean expression diagrams
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Knowledge compilation of logic programs using approximation fixpoint theory
- Binary decision diagrams for first-order predicate logic.
- Scalable probabilistic routes
- Variable ordering for decision diagrams: a portfolio approach
- Importance Sampling on Bayesian Networks with Deterministic Causalities
- An exercise in the automatic verification of asynchronous designs
- Planning in artificial intelligence
- Reasoning with propositional logic: from SAT solvers to knowledge compilation
- Quantitative fault injection analysis
- On the effect of local changes in the variable ordering of ordered decision diagrams
- A backward-traversal-based approach for symbolic model checking of uniform strategies for constrained reachability
- Computation of signal output probability for Boolean functions represented by OBDD
- A probabilistic interval-based event calculus for activity recognition
- Graph driven BDDs -- a new data structure for Boolean functions
- Offline supervisory control synthesis: taxonomy and recent developments
- Symbolic bounded synthesis
- Using variable-entered Karnaugh maps to produce compact parametric general solutions of Boolean equations
- BDD-based decision procedures for the modal logic K ★
- Stochastic dynamic programming with factored representations
- Is your model checker on time? On the complexity of model checking for timed modal logics
- A framework for memory efficient context-sensitive program analysis
- Assume-guarantee verification of nonlinear hybrid systems with ARIADNE
- Providing a formal linkage between MDG and HOL
- Compacting Boolean formulae for inference in probabilistic logic programming
- A lower bound for integer multiplication on randomized ordered read-once branching programs.
- Combining symmetry reduction and under-approximation for symbolic model checking
- Combining incomplete search and clause generation: an application to the orienteering problems with time windows
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations
- Complex event processing over distributed probabilistic event streams
- On the OBDD representation of some graph classes
- Symbolic perimeter abstraction heuristics for cost-optimal planning
- Output-size sensitiveness of OBDD construction through maximal independent set problem
- Computing the Tutte polynomial of a graph of moderate size
- Transfer of model checking to industrial practice
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
- A theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams
- FSM Encoding for BDD Representations
- Combinatorics and algorithms for low-discrepancy roundings of a real sequence
- Graph models for PLA folding problems
This page was built for publication: Graph-Based Algorithms for Boolean Function Manipulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3724245)
