725 search results - page 69 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
190
click to vote
LFCS
2007
Springer
16 years 8 days ago
2007
Springer
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
182
click to vote
CCS
2011
ACM
14 years 6 months ago
2011
ACM
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
176
click to vote
AAAI
2004
15 years 7 months ago
2004
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
158
click to vote
VMCAI
2005
Springer
15 years 11 months ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
190
click to vote
BIRTHDAY
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. This chapter considers the different temporal constructs appeared in the literature of temporal conceptual models (timestamping and evolution constraints), and it provid...