5499 search results - page 252 / 1100 » Generalized Rewrite Theories |
192
click to vote
CI
2004
15 years 7 months ago
2004
We present a general approach for representing and reasoning with sets of defaults in default logic, focussing on reasoning about preferences among sets of defaults. First, we con...
178
click to vote
ISVC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...
203
click to vote
SUM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. An ontology matching method (or a matcher) aims at matching every entity (or concept) in one ontology to the most suitable entity (or entities) in another ontology. Usual...
207
click to vote
QEST
2006
IEEE
16 years 1 months ago
2006
IEEE
Abstract. We present a compositional theory of system verification, where specifications assign real-numbered costs to systems. These costs can express a wide variety of quantita...
202
click to vote
PLDI
2005
ACM
16 years 24 days ago
2005
ACM
Today’s module systems do not effectively support information hiding in the presence of shared mutable objects, causing serious problems in the development and evolution of larg...