725 search results - page 124 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
124
Voted
CADE
2007
Springer
16 years 2 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
127
Voted
PDCAT
2005
Springer
15 years 8 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
102
click to vote
CSFW
2006
IEEE
15 years 8 months ago
2006
IEEE
Robustness links confidentiality and integrity properties of a computing system and has been identified as a useful property for characterizing and enforcing security. Previous ...
144
click to vote
ICCAD
1999
IEEE
15 years 6 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
117
Voted
DAC
2001
ACM
16 years 3 months ago
2001
ACM
New application-focused system-on-chip platforms motivate new application-specific processors. Configurable and extensible processor architectures offer the efficiency of tuned lo...