2291 search results - page 124 / 459 » Logic Programming and Model Checking |
111
click to vote
ECSQARU
2009
Springer
15 years 9 months ago
2009
Springer
Argumentation frameworks have proven to be a successful approach to formalizing commonsense reasoning. Recently, some argumentation frameworks have been extended to deal with possi...
135
Voted
ICLP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
158
click to vote
BMCBI
2011
14 years 9 months ago
2011
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
120
Voted
KBSE
2009
IEEE
15 years 9 months ago
2009
IEEE
Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structur...
122
click to vote
FOSSACS
2008
Springer
15 years 4 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...