4850 search results - page 262 / 970 » Proof and Computation in Geometry |
172
Voted
CCCG
2009
15 years 4 months ago
2009
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
173
click to vote
CSFW
2008
IEEE
16 years 1 months ago
2008
IEEE
Authorization logics provide a principled and flexible approach to specifying access control policies. One of their compelling benefits is that a proof in the logic is evidence ...
155
click to vote
LICS
2007
IEEE
16 years 28 days ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
215
click to vote
CSFW
2010
IEEE
15 years 10 months ago
2010
IEEE
—Authorization logics allow concise specification of flexible access-control policies, and are the basis for logic-based access-control systems. In such systems, resource owner...
167
click to vote
IJCAI
1993
15 years 8 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...