Sciweavers

4372 search results - page 282 / 875
» Algorithmic Theories of Everything
Sort
View
ENTCS
2006
113views more  ENTCS 2006»
15 years 6 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey
IJSN
2006
78views more  IJSN 2006»
15 years 6 months ago
An approach to synthesise safe systems
: Detectors are system components that identify whether the system is in a particular state. Detectors can be used to ensure arbitrary safety properties for systems, that is, they ...
Arshad Jhumka, Felix C. Freiling, Christof Fetzer,...
CORR
2007
Springer
64views Education» more  CORR 2007»
15 years 6 months ago
Generating models for temporal representations
We discuss the use of model building for temporal representations. We chose Polish to illustrate our discussion because it has an interesting aspectual system, but the points we w...
Patrick Blackburn, Sébastien Hinderer
SIAMDM
2008
190views more  SIAMDM 2008»
15 years 6 months ago
On the Complexity of Ordered Colorings
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
Arvind Gupta, Jan van den Heuvel, Ján Manuc...
TOCL
2008
128views more  TOCL 2008»
15 years 6 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...