1101 search results - page 126 / 221 » Forcing in proof theory |
IFM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Event-B is a notation and method for discrete systems modelling by refinement. We introduce a small but very useful construction: qualitative probabilistic choice. It ex...
SMI
2005
IEEE
15 years 6 months ago
2005
IEEE
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...
93
Voted
GC
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We present the computational counterpart of the KGP (Knowledge, Goals, Plan) declarative model of agency for Global Computing. In this context, a computational entity is ...
127
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
113
click to vote
COCO
2000
Springer
15 years 5 months ago
2000
Springer
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...