4940 search results - page 171 / 988 » On the Complexity of Universal Programs |
138
Voted
ICLP
1997
Springer
15 years 9 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
138
click to vote
TAPSOFT
1997
Springer
15 years 9 months ago
1997
Springer
This paper presents an approach for specifying complex, structured systems with Evolving Algebras by means of aggregation and composition. Evolving algebras provide a formal method...
141
click to vote
EUROCOLT
1995
Springer
15 years 8 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
167
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
137
Voted
JACM
2008
15 years 5 months ago
2008
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...