725 search results - page 62 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
176
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
160
click to vote
JLP
2000
15 years 5 months ago
2000
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
188
click to vote
CIE
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
195
click to vote
FDL
2004
IEEE
15 years 9 months ago
2004
IEEE
System-on-Chip (SOC) and other complex distributed hardware/software systems contain heterogeneous components such as DSPs, micro-controllers, application specific logic etc., whi...
160
click to vote
VRML
2003
ACM
15 years 11 months ago
2003
ACM
Embodied agents or humanoid avatars may effectively be used to communicate with human users. Currently there is a wide range of specification formalisms and scripting languages f...