3228 search results - page 440 / 646 » Computationally Sound Proofs |
128
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
147
click to vote
LOPSTR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
113
click to vote
LPNMR
2009
Springer
15 years 10 months ago
2009
Springer
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
124
click to vote
MKM
2009
Springer
15 years 10 months ago
2009
Springer
Converting mathematical documents from a human-friendly natural language to a form that can be readily processed by computers is often a tedious, manual task. Translating between v...
111
click to vote
ISBI
2008
IEEE
15 years 10 months ago
2008
IEEE
New phase-shifting techniques have recently been proposed to suppress the complex-conjugate ambiguity in frequencydomain optical-coherence tomography. A phase shift is introduced,...