Sciweavers

3663 search results - page 33 / 733
» Problems in the ontology of computer programs
Sort
View
INFORMATICALT
2000
96views more  INFORMATICALT 2000»
13 years 8 months ago
Computing True Shadow Prices in Linear Programming
It is well known that in linear programming, the optimal values of the dual variables can be interpreted as shadow prices (marginal values) of the right-hand side coefficients. How...
James K. Ho
ESWS
2005
Springer
14 years 2 months ago
Dually Structured Concepts in the Semantic Web: Answer Set Programming Approach
There is an ongoing discussion whether reasoning in the Semantic Web should be monotonic or not. It seems however that the problem concerns not only the reasoning over knowledge bu...
Patryk Burek, Rafal Grabos
WWW
2007
ACM
14 years 9 months ago
Just the right amount: extracting modules from ontologies
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...
OPODIS
2003
13 years 10 months ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg
GRID
2003
Springer
14 years 1 months ago
Autonomic Service Adaptation in ICENI using Ontological Annotation
With the advent of web services standards and a serviceoriented Grid architecture, it is foreseeable that competing as well as complimenting computational services will proliferat...
Jeffrey Hau, William Lee, Steven Newhouse