884 search results - page 100 / 177 » A Proof Theory for DL-Lite |
SMI
2005
IEEE
15 years 5 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...
GC
2004
Springer
15 years 5 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 ...
119
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 ...
107
click to vote
COCO
2000
Springer
15 years 4 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 ...
100
click to vote
PODS
1997
ACM
15 years 4 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...