Sciweavers

3044 search results - page 211 / 609
» Linear logical approximations
Sort
View
MP
2006
119views more  MP 2006»
15 years 6 months ago
Approximate extended formulations
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...
Mathieu Van Vyve, Laurence A. Wolsey
CSL
2009
Springer
16 years 1 months ago
Focalisation and Classical Realisability
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 ...
Guillaume Munch-Maccagnoni
IJCAI
1997
15 years 8 months ago
Let's Plan It Deductively!
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...
Wolfgang Bibel
JLP
1998
147views more  JLP 1998»
15 years 6 months ago
Automated Reasoning with a Constraint-Based Metainterpreter
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...
Henning Christiansen
CAV
2005
Springer
139views Hardware» more  CAV 2005»
16 years 4 days ago
The Orchids Intrusion Detection Tool
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...
Julien Olivain, Jean Goubault-Larrecq