1716 search results - page 32 / 344 » Proving Conditional Termination |
141
Voted
TC
2010
15 years 23 days ago
2010
—Reliability analysis has become a tool of fundamental importance to virtually all electrical and computer engineers because of the extensive usage of hardware systems in safety ...
117
click to vote
ECAI
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. In this paper, we present a revision strategy of revising a conditional probabilistic logic program (PLP) when new information is received (which is in the form of probab...
156
click to vote
NETWORKS
2011
14 years 5 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
150
Voted
AISC
2004
Springer
15 years 6 months ago
2004
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. We show how polynomial interpretations with negative coefficients, like x - 1 for...
143
Voted
RTA
2005
Springer
15 years 8 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...