3228 search results - page 208 / 646 » Computationally Sound Proofs |
193
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
177
click to vote
ICALP
2005
Springer
16 years 3 days ago
2005
Springer
We introduce a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribut...
155
click to vote
PERVASIVE
2004
Springer
15 years 12 months ago
2004
Springer
Based on an extensive field study of current firefighting practices, we have developed a system called Siren to support tacit communication between firefighters with multiple level...
166
click to vote
IJCAI
2007
15 years 8 months ago
2007
argumentation frameworks have played a major role as a way of understanding argumentbased inference, resulting in different argumentbased semantics. In order to make such semantic...
176
click to vote
TCS
2010
15 years 5 months ago
2010
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...