284 search results - page 1 / 57 » Modularity of Completeness Revisited |
RTA
1995
Springer
13 years 8 months ago
1995
Springer
APLAS
2007
ACM
13 years 9 months ago
2007
ACM
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
ICLP
2009
Springer
14 years 5 months ago
2009
Springer
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...
EVOW
2010
Springer
14 years 3 days ago
2010
Springer
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
APAL
2005
13 years 5 months ago
2005
We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski (...