740 search results - page 5 / 148 » A Spatial Logic for Concurrency |
LFCS
1997
Springer
13 years 11 months ago
1997
Springer
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...
SSD
2007
Springer
14 years 1 months ago
2007
Springer
The ability to continuously monitor the positions of mobile objects is important in many applications. While most past work has been set in Euclidean spaces, the mobile objects rel...
CSMR
1998
IEEE
13 years 11 months ago
1998
IEEE
AbstractA large body of research in the measurement of software complexity has been focused on imperative programs, but little eort has been made for logic programs. In this paper,...
IJCAI
1993
13 years 8 months ago
1993
Gelfond and Lifschitz introduce a declarative language A for describing effects of actions and define a translation of theories in this language into extended logic programs(ELP, ...