2162 search results - page 118 / 433 » Automated Reasoning on Feature Models |
133
click to vote
LPNMR
1997
Springer
15 years 8 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
160
click to vote
ICLP
1992
Springer
15 years 8 months ago
1992
Springer
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
125
click to vote
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
Interactive Scores is a formalism for the design and performance of interactive scenarios that provides temporal relations (TRs) among the objects of the scenario. We can model TRs...
130
click to vote
CL
2000
Springer
15 years 7 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
121
click to vote
CSL
2008
Springer
15 years 5 months ago
2008
Springer
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...