Results 1  10
of
499
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
The MONK's Problems A Performance Comparison of Different Learning Algorithms
, 1991
"... This report summarizes a comparison of different learning techniques which was performed at the 2nd European Summer School on Machine Learning, held in Belgium during summer 1991. A variety of symbolic and nonsymbolic learning techniques  namely AQ17DCI, AQ17HCI, AQ17FCLS, AQ14NT, AQ15GA, Ass ..."
Abstract

Cited by 201 (15 self)
 Add to MetaCart
is represented by six discretevalued attributes. Each problem involves learning a binary function defined over this domain, from a sample of training examples of this function. Experiments were performed with and without noise in the training examples. One significant characteristic of this comparison
Function symbols in ASP: Overview and perspectives
 IN NMR – ESSAYS CELEBRATING ITS 30TH ANNIVERSARY
, 2011
"... Answer Set Programming (ASP) is a highly expressive language that is widely used for knowledge representation and reasoning in many application scenarios. Thanks to disjunction and negation, the language allows the use of nondeterministic definitions for modeling complex problems in computer scienc ..."
Abstract
 Add to MetaCart
science, in particular in Artificial Intelligence. Traditionally, ASP has often been used as a firstorder language without function symbols, similar to Datalog, in order to deal with finite structures only. More recently, also uninterpreted function symbols have been frequently considered in the setting
Mutual Information Functions versus Correlation Functions
 Journal of Statistical Physics
, 1990
"... This paper studies one application of mutual information to symbolic sequence: the mutual information function M#d#. This function is compared with the more frequently used correlation function ,#d#. An exact relation between M#d# and ,#d# is derived for binary sequences. For sequences with more ..."
Abstract

Cited by 98 (15 self)
 Add to MetaCart
This paper studies one application of mutual information to symbolic sequence: the mutual information function M#d#. This function is compared with the more frequently used correlation function ,#d#. An exact relation between M#d# and ,#d# is derived for binary sequences. For sequences with more
Solving Symbolic Ordering Constraints
, 1990
"... We show how to solve boolean combinations of inequations s ? t in the Herbrand Universe, assuming that is interpreted as a lexicographic path ordering extending a total precedence. In other words, we prove that the existential fragment of the theory of a lexicographic path ordering which extends a ..."
Abstract

Cited by 50 (10 self)
 Add to MetaCart
also Refs 3 and 4. Introducing into the language a binary relational symbol interpreted as the subterm ordering makes the theory undecidable 5 . Venkataraman also shows in the latter paper that the purely existential fragment of the theory, i.e. the subset of sentences whose prenex form does
PartialOrder Reduction in Symbolic State Space Exploration
, 1997
"... . State space explosion is a fundamental obstacle in formal verification of designs and protocols. Several techniques for combating this problem have emerged in the past few years, among which two are significant: partialorder reductions and symbolic state space search. In asynchronous systems, ..."
Abstract

Cited by 67 (0 self)
 Add to MetaCart
relation of a system and the set of reachable states as boolean functions. In many cases, these functions can be represented compactly using binary decision diagrams (BDDs). Traditionally, the two techniques have been practiced by two different schoolspartialorder methods with enumerative depth
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
 ACM Transactions on Computational Logic
, 1999
"... The logic of equality with uninterpreted functions (EUF) provides a means of abstracting the manipulation of data by a processor when verifying the correctness of its control logic. By reducing formulas in this logic to propositional formulas, we can apply Boolean methods such as Ordered Binary Deci ..."
Abstract

Cited by 103 (29 self)
 Add to MetaCart
The logic of equality with uninterpreted functions (EUF) provides a means of abstracting the manipulation of data by a processor when verifying the correctness of its control logic. By reducing formulas in this logic to propositional formulas, we can apply Boolean methods such as Ordered Binary
Symbolic pointer analysis revisited
 In Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation
, 2004
"... Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have suggested symbolic method, which uses Bryant’s Binary Decision Diagram as an alternative to capture the pointto relation, no ..."
Abstract

Cited by 41 (1 self)
 Add to MetaCart
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have suggested symbolic method, which uses Bryant’s Binary Decision Diagram as an alternative to capture the pointto relation
Quantuminspired Evolutionary Algorithm for a Class of Combinatorial Optimization
 IEEE TRANS. EVOLUTIONARY COMPUTATION
, 2002
"... This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantuminspired evolutionary algorithm (QEA), which is based on the concept and principles of quantum computing, such as a quantum bit and superposition of states. Like other evolutionary algorithms, QEA is a ..."
Abstract

Cited by 112 (7 self)
 Add to MetaCart
is also characterized by the representation of the individual, the evaluation function, and the population dynamics. However, instead of binary, numeric, or symbolic representation, QEA uses a Qbit, defined as the smallest unit of information, for the probabilistic representation and a Qbit individual
IOS Press On the Optimality of the Binary Algorithm for the Jacobi Symbol
"... Abstract. We establish lower bounds on the complexity of computing the following numbertheoretic functions and relations from piecewise linear primitives: (i) the Legendre and Jacobi symbols, (ii) pseudoprimality, and (iii) modular exponentiation. As a corollary to the lower bound obtained for (i), ..."
Abstract
 Add to MetaCart
Abstract. We establish lower bounds on the complexity of computing the following numbertheoretic functions and relations from piecewise linear primitives: (i) the Legendre and Jacobi symbols, (ii) pseudoprimality, and (iii) modular exponentiation. As a corollary to the lower bound obtained for (i
Results 1  10
of
499