Sciweavers

336 search results - page 35 / 68
» Analytic Cut Trees
Sort
View
RTA
2010
Springer
13 years 11 months ago
A Proof Calculus Which Reduces Syntactic Bureaucracy
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
Alessio Guglielmi, Tom Gundersen, Michel Parigot
ACL
2008
13 years 9 months ago
Searching Questions by Identifying Question Topic and Question Focus
This paper is concerned with the problem of question search. In question search, given a question as query, we are to return questions semantically equivalent or close to the quer...
Huizhong Duan, Yunbo Cao, Chin-Yew Lin, Yong Yu
COLOGNETWENTE
2009
13 years 8 months ago
Improved Strategies for Branching on General Disjunctions
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
Gérard Cornuéjols, Leo Liberti, Giac...
JLP
2008
81views more  JLP 2008»
13 years 7 months ago
Cut-free sequent systems for temporal logic
Currently known sequent systems for temporal logics such as linear time temporal logic and computation tree logic either rely on a cut rule, an invariant rule, or an infinitary ru...
Kai Brünnler, Martin Lange
CORR
2002
Springer
95views Education» more  CORR 2002»
13 years 7 months ago
Qualitative Visualization of Distance Information
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
Jobst Heitzig