3658 search results - page 478 / 732 » The logic of proofs, semantically |
134
click to vote
ESWS
2005
Springer
16 years 5 days ago
2005
Springer
Although OWL is rather expressive, it has a very serious limitation on datatypes; i.e., it does not support customised datatypes. It has been pointed out that many potential users...
184
click to vote
CP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to t...
189
click to vote
CSFW
1997
IEEE
15 years 11 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
174
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
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...