10271 search results - page 639 / 2055 » Computer Science |
198
click to vote
RTA
2009
Springer
16 years 2 months ago
2009
Springer
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...
169
click to vote
RTA
2009
Springer
16 years 2 months ago
2009
Springer
It is known that the first-order theory with a single predicate → that denotes one-step rewriting reduction on terms is undecidable already for formulae with ∃∀ prefix. Sev...
187
Voted
TLCA
2009
Springer
16 years 2 months ago
2009
Springer
Friedman showed how to turn a classical proof of a Σ0 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classi...
202
click to vote
CSE
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper summarizes our work on a parallel algorithm for an interacting particle model, derived from the model by Czirok, Vicsek, et. al. [3, 4, 5, 13, 14]. Our model is particu...
234
click to vote
ENC
2008
IEEE
16 years 1 months ago
2008
IEEE
In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable fr...