11160 search results - page 80 / 2232 » Incompleteness in a General Setting |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
GC
2010
Springer
13 years 8 months ago
2010
Springer
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
LPNMR
2005
Springer
14 years 3 months ago
2005
Springer
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
SAC
2006
ACM
14 years 3 months ago
2006
ACM
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
ICML
2003
IEEE
14 years 10 months ago
2003
IEEE
We examine the set covering machine when it uses data-dependent half-spaces for its set of features and bound its generalization error in terms of the number of training errors an...