622 search results - page 76 / 125 » Answer Set Programming and Bounded Model Checking |
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
SIAMCOMP
2012
11 years 10 months ago
2012
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
AI
2010
Springer
13 years 4 months ago
2010
Springer
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
ERSHOV
2009
Springer
13 years 5 months ago
2009
Springer
Model checking of software has been a very active research topic recently. As a result, a number of software model checkers have been developed for analysis of software written in ...