2381 search results - page 242 / 477 » On Ordering Descriptions in a Description Logic |
157
click to vote
CIE
2007
Springer
16 years 25 days ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
155
click to vote
SEMWEB
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. After becoming a W3C Recommendation, OWL is becoming increasingly widely accepted and used. However most people still find it difficult to create and use OWL ontologies...
187
click to vote
GECCO
2004
Springer
16 years 1 days ago
2004
Springer
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
172
click to vote
ARTS
1999
Springer
15 years 11 months ago
1999
Springer
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. Tools compute the numerical solution of these models; however, the st...
149
Voted
PARLE
1992
15 years 10 months ago
1992
We compare di erent degrees of architecture abstraction and communication reliability in distributed programming languages. A nearly architecture independent logic programming lang...