Sciweavers

1024 search results - page 18 / 205
» Value complete, column complete, predicate complete
Sort
View
MLQ
2008
103views more  MLQ 2008»
15 years 1 months ago
On contraction and the modal fragment
We observe that removing contraction from a standard sequent calculus for first-order predicate logic preserves completeness for the modal fragment.
Kai Brünnler, Dieter Probst, Thomas Studer
DISOPT
2008
81views more  DISOPT 2008»
15 years 1 months ago
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
Matthias Köppe, Quentin Louveaux, Robert Weis...
BIRTHDAY
2010
Springer
15 years 2 months ago
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
Dexter Kozen
CORR
2010
Springer
189views Education» more  CORR 2010»
15 years 2 days ago
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
Huan Xu, Constantine Caramanis, Sujay Sanghavi
APAL
2006
66views more  APAL 2006»
15 years 1 months ago
The Skolemization of existential quantifiers in intuitionistic logic
In this paper an alternative Skolemization method is introduced that for a large class of formulas is sound and complete with respect to intuitionistic logic. This class extends t...
Matthias Baaz, Rosalie Iemhoff