725 search results - page 86 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
173
click to vote
HOTDEP
2008
15 years 8 months ago
2008
We describe a technique for writing distributed applications which manage themselves over one or more utility computing infrastructures: by dynamically acquiring new computational...
154
click to vote
JAIR
2008
15 years 6 months ago
2008
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
147
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
166
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
173
click to vote
PLDI
2009
ACM
16 years 25 days ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...