2162 search results - page 121 / 433 » Automated Reasoning on Feature Models |
170
Voted
LICS
2012
IEEE
13 years 6 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
106
click to vote
CADE
2002
Springer
16 years 4 months ago
2002
Springer
In this paper we define a new clausal class, called BU, which can be decided by hyperresolution with splitting. We also consider the model generation problem for BU and show that h...
138
click to vote
SMA
1999
ACM
15 years 8 months ago
1999
ACM
Nearly all major commercial computer-aided design systems have adopted a feature-based design approach to solid modeling. Models are created via a sequence of operations which app...
142
click to vote
ICCV
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper describes an approach to recovering surface models of complex scenes from the quasi-sparse data returned by a feature based stereo system. The method can be used to mer...
166
click to vote
ECSQARU
2005
Springer
15 years 9 months ago
2005
Springer
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...