2303 search results - page 371 / 461 » On the logic of argumentation theory |
170
click to vote
JSYML
2007
15 years 6 months ago
2007
The paper studies how the localic notion of sublocale transfers to formal topology. For any formal topology (not necessarily with positivity predicate) we define a sublocale to b...
174
click to vote
FAC
2000
15 years 6 months ago
2000
Formal approaches to the design of interactive systems rely on reasoning about properties of the t a very high level of abstraction. Specifications to support such an approach typi...
181
click to vote
JETAI
2000
15 years 6 months ago
2000
In this paper we provide a foundation of a theory of contextual reasoning from the perspective of a theory of knowledge representation. Starting from the so-called metaphor of the...
149
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
231
click to vote
CC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...