Sciweavers

2035 search results - page 198 / 407
» On the complexity of stratified logics
Sort
View
ICCD
2005
IEEE
135views Hardware» more  ICCD 2005»
16 years 3 months ago
Extended Forward Implications and Dual Recurrence Relations to Identify Sequentially Untestable Faults
In this paper, we make two major contributions: First, to enhance Boolean learning, we propose a new class of logic implications called extended forward implications. Using a nove...
Manan Syal, Rajat Arora, Michael S. Hsiao
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
16 years 3 months ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
PPDP
2009
Springer
16 years 1 months ago
A declarative encoding of telecommunications feature subscription in SAT
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
Michael Codish, Samir Genaim, Peter J. Stuckey
CSFW
2008
IEEE
16 years 29 days ago
DKAL: Distributed-Knowledge Authorization Language
DKAL is a new declarative authorization language for distributed systems. It is based on existential fixed-point logic and is considerably more expressive than existing authoriza...
Yuri Gurevich, Itay Neeman
IPPS
2007
IEEE
16 years 24 days ago
A Study of Design Efficiency with a High-Level Language for FPGAs
Over the years reconfigurable computing devices such as FPGAs have evolved from gate-level glue logic to complex reprogrammable processing architectures. However, the tools used f...
Zain-ul-Abdin, Bertil Svensson