Sciweavers

1128 search results - page 74 / 226
» Classical Natural Deduction
Sort
View
SAC
2002
ACM
14 years 11 months ago
Soft constraint propagation and solving in CHRs
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
Stefano Bistarelli, Thom W. Frühwirth, Michae...
BMVC
2010
14 years 10 months ago
Active 3D Segmentation through Fixation of Previously Unseen Objects
We present an approach for active segmentation based on integration of several cues. It serves as a framework for generation of object hypotheses of previously unseen objects in n...
Mårten Björkman, Danica Kragic
ICASSP
2011
IEEE
14 years 3 months ago
Nonnegative 3-way tensor factorization via conjugate gradient with globally optimal stepsize
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
Jean-Philip Royer, Pierre Comon, Nadège Thi...
MLQ
2007
90views more  MLQ 2007»
14 years 11 months ago
Kripke submodels and universal sentences
We define two notions for intuitionistic predicate logic: that of a submodel of a Kripke model, and that of a universal sentence. We then prove a corresponding preservation theor...
Ben Ellison, Jonathan Fleischmann, Dan McGinn, Wim...
SAT
2007
Springer
118views Hardware» more  SAT 2007»
15 years 6 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov