3044 search results - page 211 / 609 » Linear logical approximations |
133
Voted
MP
2006
15 years 3 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
107
Voted
CSL
2009
Springer
15 years 10 months ago
2009
Springer
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
102
Voted
IJCAI
1997
15 years 5 months ago
1997
The paper describes a transition logic, TL, and a deductive formalism for it. It shows how various important aspects (such as ramification, qualification, specificity, simultaneit...
115
Voted
JLP
1998
15 years 3 months ago
1998
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
136
Voted
CAV
2005
Springer
15 years 9 months ago
2005
Springer
ORCHIDS is an intrusion detection tool based on techniques for fast, on-line model-checking. Temporal formulae are taken from a temporal logic tailored to the description of intrus...