257 search results - page 47 / 52 » The Complexity of Model Checking for Propositional Default L... |
NGITS
1999
Springer
13 years 11 months ago
1999
Springer
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
ICCAD
1999
IEEE
13 years 11 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 ...