Sciweavers

1391 search results - page 17 / 279
» Completeness of Neighbourhood Logic
Sort
View
IGPL
2008
67views more  IGPL 2008»
13 years 7 months ago
Complete Axiomatisations of Properties of Finite Sets
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...
Thomas Ågotnes, Michal Walicki
ENTCS
2008
85views more  ENTCS 2008»
13 years 7 months ago
Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning technique of logical relations in a case study about equivalence checking. He pr...
Julien Narboux, Christian Urban
LOGCOM
2008
138views more  LOGCOM 2008»
13 years 7 months ago
Complete Axiomatization of Discrete-Measure Almost-Everywhere Quantification
Following recent developments in the topic of generalized quantifiers, and also having in mind applications in the areas of security and artificial intelligence, a conservative en...
Luís Cruz-Filipe, João Rasga, Am&iac...
CF
2007
ACM
13 years 11 months ago
Massively parallel processing on a chip
MppSoC is a SIMD architecture composed of a grid of processors and memories connected by a X-Net neighbourhood network and a general purpose global router. MppSoC is an evolution ...
Philippe Marquet, Simon Duquennoy, Sébastie...
CP
2006
Springer
13 years 11 months ago
Inferring Variable Conflicts for Local Search
Abstract. For efficiency reasons, neighbourhoods in local search are often shrunk by only considering moves modifying variables that actually contribute to the overall penalty. The...
Magnus Ågren, Pierre Flener, Justin Pearson