394 search results - page 7 / 79 » Logical operations and Kolmogorov complexity |
DATE
2004
IEEE
14 years 14 days ago
2004
IEEE
Reconfigurable Systems-on-Chip (SoC) consist of large Field-Programmable Gate-Arrays (FPGAs) and standard processors. The reconfigurable logic can be used for application-specific...
LPAR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
FROCOS
2009
Springer
14 years 3 months ago
2009
Springer
We investigate the temporal extension of the description logic DL-Lite(RN ) bool with the until operator on concepts, rigid (time-independent) and local (time-dependent) roles, and...
JACM
2002
13 years 8 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
FUIN
2007
13 years 8 months ago
2007
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...