116
click to vote
ASPDAC
2001
ACM
15 years 7 months ago
2001
ACM
Abstract- Traditional state-traversal-basedmethods for verifying sequential circuits are computationally infeasible for circuits with a large number of memory elements. However, if...
ASPDAC
2001
ACM
15 years 7 months ago
2001
ACM
153
click to vote
ASP
2001
Springer
15 years 7 months ago
2001
Springer
This paper presents a novel application of answer set programming to concept learning in nonmonotonic logic programs. Given an extended logic program as a background theory, we in...
126
click to vote
ASP
2001
Springer
15 years 7 months ago
2001
Springer
We propose a situation calculus formalization of action domains that include numeric-valued fluents (so-called additive or measure fluents) and concurrency. Our approach allows fo...