Sciweavers

1557 search results - page 68 / 312
» Programming up to Congruence
Sort
View
SIGOPSE
1998
ACM
15 years 3 months ago
Goal-oriented programming, or composition using events, or threads considered harmful
with this, the thread abstraction was introduced. While threads are handling events, or awaiting specific events, unrelated events can be handled by other threads. Unfortunately, ...
Robbert van Renesse
CORR
2004
Springer
124views Education» more  CORR 2004»
14 years 11 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
CEC
2005
IEEE
15 years 4 months ago
A simple hybrid evolutionary algorithm for finding Golomb rulers
Abstract- Finding Golomb rulers is an extremely challenging optimization problem (with many practical applications) that has been approached by a variety of search methods in recen...
Iván Dotú, Pascal Van Hentenryck
79
Voted
ICALP
2005
Springer
15 years 4 months ago
Up-to Techniques for Weak Bisimulation
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
Damien Pous
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
15 years 2 months ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang