2519 search results - page 394 / 504 » Reasoning with Textual Cases |
127
click to vote
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
152
click to vote
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
The `Cooperation Logic of Propositional Control', cl-pc, of van der Hoek and Wooldridge is a logic for reasoning about the ability of agents and groups of agents to obtain a ...
115
click to vote
ICALP
2010
Springer
15 years 6 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...
135
click to vote
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
155
click to vote
ESAS
2006
Springer
15 years 6 months ago
2006
Springer
This work describes a low-cost Public-Key Cryptography (PKC) based solution for security services such as key-distribution and authentication as required for wireless sensor networ...