271 search results - page 14 / 55 » A comparison between two logical formalisms for rewriting |
83
Voted
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to ...
89
Voted
SEMWEB
2007
Springer
15 years 6 months ago
2007
Springer
The ability to compute the differences that exist between two RDF models is an important step to cope with the evolving nature of the Semantic Web (SW). In particular, RDF Deltas c...
98
Voted
DLOG
2003
15 years 1 months ago
2003
In this chapter, we are concerned with the relationship between Description Logics and other formalisms, regardless of whether they were designed for knowledge representation issu...
93
Voted
ENTCS
2002
15 years 8 days ago
2002
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
139
click to vote
PEPM
2010
ACM
15 years 2 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...