Sciweavers

1818 search results - page 105 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
AAAI
1994
13 years 10 months ago
Soundness and Completeness of a Logic Programming Approach to Default Logic
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
Grigoris Antoniou, Elmar Langetepe
WCE
2007
13 years 10 months ago
A Competitive Online Algorithm for File Restriping
—We present a 3-competitive online algorithm for determining when to restripe a file for the case when the optimum stripe depth can take one of two possible values, depending on ...
Mario R. Medina
ENDM
2010
87views more  ENDM 2010»
13 years 9 months ago
Euler Complexes (Oiks)
We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence...
Jack Edmonds
APAL
2006
73views more  APAL 2006»
13 years 9 months ago
Compactness in locales and in formal topology
If a locale is presented by a "flat site", it is shown how its frame can be presented by generators and relations as a dcpo. A necessary and sufficient condition is deri...
Steven J. Vickers
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 4 months ago
Multi-resolution path planning: Theoretical analysis, efficient implementation, and extensions to dynamic environments
A multi-resolution path planning algorithm based on the wavelet transform of the environment has been reported previously in the literature. In this paper, we provide a proof of co...
Raghvendra V. Cowlagi, Panagiotis Tsiotras