1274 search results - page 96 / 255 » New Proofs for |
67
Voted
ANOR
2002
15 years 18 days ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
93
Voted
CSL
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
97
Voted
COMMA
2006
15 years 2 months ago
2006
Abstract. This paper proposes an argument-based semantics for combined epistemic and practical reasoning, taking seriously the idea that in certain contexts epistemic reasoning is ...
103
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
This paper proves that in Size Theory the comparison of multidimensional size functions can be reduced to the 1-dimensional case by a suitable change of variables. Indeed, we show...
99
Voted
COMBINATORICS
1998
15 years 12 days ago
1998
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that t...