4401 search results - page 358 / 881 » Computing with Default Logic |
181
click to vote
ICTCS
2003
Springer
15 years 12 months ago
2003
Springer
The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious beh...
196
click to vote
CSL
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
185
click to vote
CONCUR
2004
Springer
16 years 3 days ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
197
click to vote
POPL
2012
ACM
14 years 2 months ago
2012
ACM
JavaScript has become the most widely used language for clientside web programming. The dynamic nature of JavaScript makes understanding its code notoriously difficult, leading t...
177
click to vote
FCCM
1997
IEEE
15 years 11 months ago
1997
IEEE
By strictly separating reconfigurable logic from their host processor, current custom computing systems suffer from a significant communication bottleneck. In this paper we descri...