346 search results - page 58 / 70 » Logical omniscience as a computational complexity problem |
ICALP
2010
Springer
15 years 1 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
107
Voted
ATAL
2010
Springer
15 years 23 days ago
2010
Springer
Social laws have proved to be a powerful and theoretically elegant framework for coordination in multi-agent systems. Most existing models of social laws assume that a designer is...
98
Voted
ESWS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
96
Voted
DAC
2008
ACM
16 years 20 days ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
119
click to vote
ICCAD
1999
IEEE
15 years 4 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 ...