Sciweavers

1187 search results - page 85 / 238
» Computation in Extended Argumentation Frameworks
Sort
View
ENTCS
2007
89views more  ENTCS 2007»
15 years 1 months ago
Hierarchical Nominal Terms and Their Theory of Rewriting
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...
Murdoch Gabbay
PST
2008
15 years 2 months ago
Encoding the Program Correctness Proofs as Programs in PCC Technology
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...
Heidar Pirzadeh, Danny Dubé
PPDP
2009
Springer
15 years 8 months ago
Set functions for functional logic programming
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...
Sergio Antoy, Michael Hanus
ACL
2011
14 years 5 months ago
Event Extraction as Dependency Parsing
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...
David McClosky, Mihai Surdeanu, Christopher D. Man...
OTM
2007
Springer
15 years 7 months ago
Fine Grained Access Control with Trust and Reputation Management for Globus
Abstract. We propose an integrated architecture, extending a framework for fine grained access control of Grid computational services, with an inference engine managing reputation...
Maurizio Colombo, Fabio Martinelli, Paolo Mori, Ma...