Sciweavers

7988 search results - page 24 / 1598
» A Useful Undecidable Theory
Sort
View
IMPERIAL
1993
14 years 26 days ago
Deriving Category Theory from Type Theory
This work expounds the notion that (structured) categories are syntax free presentations of type theories, and shows some of the ideas involved in deriving categorical semantics f...
Roy L. Crole
FSTTCS
2004
Springer
14 years 2 months ago
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems
This paper deals with distributed control problems by means of distributed games played on Mazurkiewicz traces. The main difference with other notions of distributed games recentl...
Paul Gastin, Benjamin Lerman, Marc Zeitoun
ICTAI
1994
IEEE
14 years 27 days ago
Iterative Strengthening: An Algorithm for Generating Anytime Optimal Plans
In order to perform adequately in real-world situations, a planning system must be able to nd the \best" solution while still supporting anytime behavior. We have developed ...
Randall J. Calistri-Yeh
ACTA
2007
104views more  ACTA 2007»
13 years 9 months ago
Decision problems for pushdown threads
Threads as contained in a thread algebra emerge from the behavioral abstraction from programs in an appropriate program algebra. Threads may make use of services such as stacks, an...
Jan A. Bergstra, Inge Bethke, Alban Ponse
DEXA
2009
Springer
70views Database» more  DEXA 2009»
14 years 3 months ago
On the Termination Problem for Declarative XML Message Processing
Abstract. We define a formal syntax and semantics for the Rule Definition Language (RDL) of DemaqLite, which is a fragment of the declarative XML message processing system Demaq....
Tadeusz Litak, Sven Helmer