1187 search results - page 85 / 238 » Computation in Extended Argumentation Frameworks |
149
click to vote
ENTCS
2007
15 years 6 months ago
2007
Nominal rewriting introduced a novel method of specifying rewriting on syntax-with-binding. We extend this treatment of rewriting with hierarchy of variables representing increasi...
157
click to vote
PST
2008
15 years 8 months ago
2008
One of the key issues with the practical applicability of Proof-Carrying Code (PCC) and its related methods is the difficulty in communicating and storing the proofs which are inh...
172
click to vote
PPDP
2009
Springer
16 years 1 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
201
click to vote
ACL
2011
14 years 10 months ago
2011
Nested event structures are a common occurrence in both open domain and domain specific extraction tasks, e.g., a “crime” event can cause a “investigation” event, which c...
173
click to vote
OTM
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We propose an integrated architecture, extending a framework for fine grained access control of Grid computational services, with an inference engine managing reputation...