3552 search results - page 372 / 711 » Proof theory in the abstract |
196
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...
188
click to vote
TCS
2002
15 years 6 months ago
2002
We show how formal specifications can be integrated into one of the current pragmatic object-oriented software development methods. Jacobson's "Object-Oriented Software ...
195
click to vote
ICTAC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Separation kernels are key components in embedded applications. Their small size and widespread use in high-integrity environments make them good targets for formal model...
178
click to vote
PRICAI
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...
168
click to vote
TCS
2010
15 years 5 months ago
2010
Abstract. It is an open problem in the area of effective (algorithmic) randomness whether Kolmogorov-Loveland randomness coincides with Martin-L¨of randomness. Joe Miller and And...