1117 search results - page 137 / 224 » Partial Models of Extended Generalized Logic Programs |
112
click to vote
IOR
2006
15 years 1 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
100
Voted
CTCS
1989
Springer
15 years 5 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
207
click to vote
POPL
2005
ACM
16 years 1 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
135
click to vote
CCS
2005
ACM
15 years 7 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
111
click to vote
ICFP
2010
ACM
15 years 2 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...