203 search results - page 31 / 41 » Datatype-Generic Termination Proofs |
155
click to vote
WOLLIC
2009
Springer
15 years 11 months ago
2009
Springer
Bi-intuitionistic logic is the extension of intuitionistic logic with exclusion, a connective dual to implication. Cut-elimination in biintuitionistic logic is complicated due to t...
143
Voted
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
141
click to vote
TLCA
2007
Springer
15 years 10 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
136
click to vote
BIRTHDAY
2006
Springer
15 years 8 months ago
2006
Springer
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...
159
click to vote
CAV
2001
Springer
15 years 8 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...