2976 search results - page 268 / 596 » On the bounded integer programming |
180
click to vote
ASP
2005
Springer
15 years 10 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
158
click to vote
CP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to t...
151
click to vote
CLUSTER
2000
IEEE
15 years 9 months ago
2000
IEEE
We propose a programming model for distributed concurrent systems with mobile objects in the context of a process calculus. Code mobility is induced by lexical scoping on names. O...
115
click to vote
AAAI
2010
15 years 6 months ago
2010
Trial-based approaches offer an efficient way to solve singleagent MDPs and POMDPs. These approaches allow agents to focus their computations on regions of the environment they en...
135
Voted
ENTCS
2007
15 years 5 months ago
2007
If a program does not fulfill a given specification, a model checker delivers a counterexample, a run which demonstrates the wrong behavior. Even with a counterexample, locating...