95 search results - page 8 / 19 » On Notions of Completeness Weaker than Kripke Completeness |
CADE
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
IOR
2010
13 years 7 months ago
2010
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
ER
2007
Springer
14 years 3 months ago
2007
Springer
It is increasingly recognised that user preferences should be addressed in many advanced database applications, such as adaptive searching in databases. However, the fundamental is...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
DKE
2008
13 years 8 months ago
2008
In various application domains there is a desire to compare process models, e.g., to relate an organization-specific process model to a reference model, to find a web service matc...