#### Filter Results:

#### Publication Year

1991

2014

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Traditional algorithms for prime implicate genera-require the input formulas to be first transformed into a CNF formula. This process, however, requires exponential time in the worst case and can result in an exponential blow up of the input size. Such cases occur frequently when the problem domains are best characterized by some DNF formulas. In this… (More)

We demonstrate how order-theoretic abstractions can be useful in identifying , formalizing, and exploiting relationships between seemingly dissimilar AI algorithms that perform computations on partially-ordered sets. In particular, we show how the order-theoretic concept of an anti-chain can be used to provide an ecient representation for such sets when… (More)

In this paper we present a method of attacking public-key cryptosystems (PKCs) on tamper resistant devices. The attack makes use of transient faults and seems applicable to many types of PKCs. In particular, we show how to attack the RSA, the ElGamal signature scheme, the Schnorr signature scheme, and the DSA. We also present some possible methods to… (More)

We demonstrate how order-theoretic abstractions can be useful in identifying , formalizing, and exploiting relationships between seemingly dissimilar AI algorithms that perform computations on partially-ordered sets. In particular, we show how the order-theoretic concept of an anti-chain can be used to provide an eecient representation for such sets when… (More)

This paper presents a new on-line cash check scheme which guarantees payor anonymity and improves upon existing similar schemes in efficiency and security. Electronic commerce, which combines the efficiency of computerization and networking, is going to dramatically change the way in which business is conducted today. One of the key issues for the… (More)

In this paper we present a theory of anti-chains as data representations for sets in circumstances where sets of interest satisfy properties such as being upward-closed or convex relative to a partial ordering. Our goal is to provide an interface for supplying an implementation of the necessary primitives in a reusable manner and a theory that will… (More)

- Teow-Hin Ngair, Gregory Provan
- 2014

The Assumption-based Truth Maintenance System (ATMS) is a general and powerful problem-solving tool in AI. Unfortunately, its generality usually entails a high computational cost. In this paper, we study how a general notion of cost function can be incorporated into the design of an algorithm for focusing the ATMS, called BF-ATMS. The BF-ATMS algorithm… (More)

- ‹
- 1
- ›