39 search results - page 1 / 8 » A Direct Semantic Characterization of RELFUN |
ELP
1992
14 years 2 months ago
1992
COMMA
2010
13 years 5 months ago
2010
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among argumen...
SP
2008
IEEE
13 years 9 months ago
2008
IEEE
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
MATES
2007
Springer
14 years 5 months ago
2007
Springer
Although the flexibility of agent interactions has many advantages when it comes to engineering a complex system, the downside is that it leads to certain unpredictability of the ...
SEMWEB
2010
Springer
13 years 8 months ago
2010
Springer
RDF(S) and OWL 2 currently support only static ontologies. In practice, however, the truth of statements often changes with time, and Semantic Web applications often need to repres...