Sciweavers

330 search results - page 3 / 66
» Algorithms for Propositional Model Counting
Sort
View
JAPLL
2006
97views more  JAPLL 2006»
13 years 5 months ago
Model checking propositional dynamic logic with all extras
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
Martin Lange
ICDCSW
2000
IEEE
13 years 10 months ago
Games-Based Model Checking of Protocols: counting doesn't count
We introduce a technique that can be used to model the behaviour of protocols. In our model each process within a protocol belongs to a particular class. A set of rules governs th...
Tim Kempster, Colin Stirling, Peter Thanisch
UAI
2008
13 years 7 months ago
Hybrid Variational/Gibbs Collapsed Inference in Topic Models
Variational Bayesian inference and (collapsed) Gibbs sampling are the two important classes of inference algorithms for Bayesian networks. Both have their advantages and disadvant...
Max Welling, Yee Whye Teh, Bert Kappen
PARLE
1991
13 years 9 months ago
The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes
It is shown that the terminationdetection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the te...
Gerard Tel, Friedemann Mattern
FOIKS
2008
Springer
13 years 7 months ago
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arg...
Vasiliki Efstathiou, Anthony Hunter