Sciweavers

605 search results - page 83 / 121
» Dealing with logical omniscience
Sort
View
CADE
2009
Springer
14 years 9 months ago
Complexity of Fractran and Productivity
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...
Clemens Grabmayer, Dimitri Hendriks, Jörg End...
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
14 years 9 months ago
A notation and system for expressing and executing cleanly typed workflows on messy scientific data
The description, composition, and execution of even logically simple scientific workflows are often complicated by the need to deal with "messy" issues like heterogeneou...
Yong Zhao, James E. Dobson, Ian T. Foster, Luc Mor...
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
14 years 3 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...
COORDINATION
2007
Springer
14 years 3 months ago
Fact Spaces: Coordination in the Face of Disconnection
Coordination languages for ad hoc networks with a fluid topology do not offer adequate support to detect and deal with device disconnection. Such a disconnection is particularly ...
Stijn Mostinckx, Christophe Scholliers, Eline Phil...
BIRTHDAY
2005
Springer
14 years 2 months ago
Objective Bayesian Nets
I present a formalism that combines two methodologies: objective Bayesianism and Bayesian nets. According to objective Bayesianism, an agent’s degrees of belief (i) ought to sat...
Jon Williamson