Sciweavers

1419 search results - page 49 / 284
» Notes on Formalizing Context
Sort
View
95
Voted
ACL
1992
15 years 1 months ago
Recognition of Linear Context-Free Rewriting Systems
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
Giorgio Satta
94
Voted
GG
2008
Springer
15 years 1 months ago
Parallel and Sequential Independence for Borrowed Contexts
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
Filippo Bonchi, Fabio Gadducci, Tobias Heindel
90
Voted
HICSS
2008
IEEE
135views Biometrics» more  HICSS 2008»
15 years 7 months ago
Formal Foundation of Workflow Hyperpaths and a Graph Search Algorithm for Workflow Hyperpath Generation
While executing a process, many decisions are taken at its various decision points for selecting paths. There is a need for understanding and analyzing on various paths that emana...
Sinnakkrishnan Perumal, Ambuj Mahanti
113
Voted
BIRTHDAY
2004
Springer
15 years 6 months ago
On the Formal Modelling of Trust in Reputation-Based Systems
In a reputation-based trust management system an entity’s behaviour determines its reputation which in turn affects other entities interaction with it. We present a mathematical...
Mogens Nielsen, Karl Krukow
119
Voted
IESA
2007
15 years 2 months ago
Formalizing the OPAL eBusiness ontology design patterns with OWL
Domain ontology building is one of the most critical activities required in Semantic Web applications. The task must be performed by domain experts, who do not (generally) have the...
Fulvio D'Antonio, Michele Missikoff, Francesco Tag...