934 search results - page 71 / 187 » Elementary Sets of Logic Programs |
189
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
90
Voted
ILP
2007
Springer
15 years 4 months ago
2007
Springer
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...
102
click to vote
FCSC
2010
14 years 7 months ago
2010
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
This paper proposes a new parallel execution model where programmers augment a sequential program with pieces of code called serializers that dynamically map computational operati...
70
Voted
CSL
2004
Springer
15 years 3 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...