3572 search results - page 441 / 715 » Nominal Logic Programming |
134
click to vote
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
155
click to vote
KBSE
2007
IEEE
15 years 11 months ago
2007
IEEE
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...
136
click to vote
LPNMR
2007
Springer
15 years 11 months ago
2007
Springer
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
150
click to vote
WSC
2000
15 years 6 months ago
2000
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...
142
Voted
IOR
2006
15 years 5 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...