726 search results - page 89 / 146 » Reasoning about Feature Models in Higher-Order Logic |
148
click to vote
IJCAI
1997
15 years 7 months ago
1997
Explicit preferences on assumptions as used in prioritized circumscription [McCarthy, 1986; Lifschitz, 1985; Grosof, 1991] and preferred subtheories [Brewka, 1989] provide a clear...
260
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
153
click to vote
JELIA
2004
Springer
15 years 11 months ago
2004
Springer
In this work we reconsider the replacement of predicate-like notation by functional terms, using a similar syntax to Functional Logic Programming, but under a completely different...
129
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
In many theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
132
click to vote
CAV
2007
Springer
16 years 3 days ago
2007
Springer
Abstract. While effective methods for bit-level verification of low-level properties exist, system-level properties that entail reasoning about a significant part of the design p...