3424 search results - page 478 / 685 » Automated Testing of Classes |
147
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
124
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
195
click to vote
WFLP
2009
Springer
15 years 11 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
228
click to vote
LOPSTR
2009
Springer
15 years 11 months ago
2009
Springer
Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...
130
click to vote
LPNMR
2009
Springer
15 years 11 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...