1242 search results - page 131 / 249 » The Theory of Grammar Constraints |
102
Voted
MODELS
2010
Springer
14 years 11 months ago
2010
Springer
In feature models’ construction, one basic task is to ensure the consistency of feature models, which often involves detecting and fixing of inconsistencies in feature models. S...
123
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
108
Voted
SIGGRAPH
1995
ACM
15 years 4 months ago
1995
ACM
Physically-based modeling has been used in the past to support a variety of interactive modeling tasks including free-form surface design, mechanism design, constrained drawing, a...
117
click to vote
LPAR
2005
Springer
15 years 6 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
128
Voted
AR
2007
15 years 29 days ago
2007
—Researchers in robotics and artificial intelligence have often looked at biology as a source of inspiration for solving their problems. From the opposite perspective, neuroscie...