Sciweavers

11160 search results - page 402 / 2232
» Incompleteness in a General Setting
Sort
View
DCC
2010
IEEE
15 years 7 months ago
Minimum distance of Hermitian two-point codes
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
Seungkook Park
184
Voted
APAL
2005
135views more  APAL 2005»
15 years 6 months ago
Safe beliefs for propositional theories
We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more genera...
Mauricio Osorio, Juan Antonio Navarro Pérez...
COMBINATORICS
2004
100views more  COMBINATORICS 2004»
15 years 6 months ago
Lattice Structures from Planar Graphs
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
Stefan Felsner
199
Voted
ISCI
2002
106views more  ISCI 2002»
15 years 6 months ago
Neighborhood operator systems and approximations
This paper presents a framework for the study of generalizing the standard notion of equivalence relation in rough set approximation space with various categories of k-step neighb...
Wei-Zhi Wu, Wen-Xiu Zhang
MLQ
2002
74views more  MLQ 2002»
15 years 6 months ago
Computability on Regular Subsets of Euclidean Space
For the computability of subsets of real numbers, several reasonable notions have been suggested in the literature. We compare these notions in a systematic way by relating them to...
Martin Ziegler