2162 search results - page 362 / 433 » Automated Reasoning on Feature Models |
200
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
173
Voted
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
229
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
192
click to vote
ICLP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
201
click to vote
ICLP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...