1435 search results - page 192 / 287 » Description Logics |
CIE
2007
Springer
14 years 5 months 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...
GECCO
2004
Springer
14 years 4 months 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...
ARTS
1999
Springer
14 years 3 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...
PARLE
1992
14 years 3 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...
FUZZIEEE
2007
IEEE
14 years 3 months ago
2007
IEEE
One of the most important features of fuzzy set theory is its potential for the modeling of natural language expressions. Most works done on this topic focus on some parts of natur...