Sciweavers

7167 search results - page 380 / 1434
» Answer Set Programming
Sort
View
141
Voted
CONCUR
2008
Springer
15 years 5 months ago
A Model of Dynamic Separation for Transactional Memory
Abstract. Dynamic separation is a new programming discipline for systems with transactional memory. We study it formally in the setting of a small calculus with transactions. We pr...
Martín Abadi, Tim Harris, Katherine F. Moor...
ECAI
2010
Springer
15 years 4 months ago
Verifying Properties of Infinite Sequences of Description Logic Actions
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem be...
Franz Baader, Hongkai Liu, Anees ul Mehdi
115
Voted
EDBT
2006
ACM
120views Database» more  EDBT 2006»
16 years 3 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
WLP
2000
Springer
15 years 7 months ago
A Dynamic Approach to Deductive Query Evaluation
In this paper, a dynamic approach to deductive query evaluation is presented which combines the e ects of di erent SIP strategies used for the magic set rewriting technique. Given...
Andreas Behrend
118
Voted
ESOP
2010
Springer
16 years 23 days ago
Deadlock-free Channels and Locks
The combination of message passing and locking to protect shared state is a useful concurrency pattern. However, programs that employ this pattern are susceptible to deadlock. That...
Jan Smans, K. Rustan M. Leino, Peter Müller