1101 search results - page 108 / 221 » Forcing in proof theory |
85
Voted
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
85
Voted
ISCAS
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract— This paper derives a novel property of the secondorder modes of discrete-time systems under variable transformation. This is the generalization of the theory presented ...
104
click to vote
ECAI
2004
Springer
15 years 6 months ago
2004
Springer
This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, th...
FOSSACS
2004
Springer
15 years 6 months ago
2004
Springer
We introduce a computational interpretation for Hilbert’s choice operator (ε). This interpretation yields a typed foundation for dynamic linking in software systems. The use of ...
TACAS
2004
Springer
15 years 6 months ago
2004
Springer
We present a method of deriving Craig interpolants from proofs in the quantifier-free theory of linear inequality and uninterpreted function symbols, and an interpolating theorem...