ASP
2001
Springer
13 years 8 months ago
2001
Springer
ASP
2001
Springer
13 years 8 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...
ASP
2001
Springer
13 years 8 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...
ASP
2001
Springer
13 years 8 months ago
2001
Springer
ASP
2001
Springer
13 years 8 months ago
2001
Springer
In this paper we implement planning using answer set programming. We consider the action language A and its extensions. We show that when the domain is described using richer feat...
ASP
2001
Springer
13 years 9 months ago
2001
Springer
Being able to declaratively specify control within a planning (or theorem-proving) paradigm is necessary if we are to build intelligent machines. This paper introduces an implemen...
ASP
2001
Springer
13 years 9 months ago
2001
Springer
Default Logic and Logic Programming with stable model semantics are recognized as powerful frameworks for incomplete information representation. Their expressive power are suitabl...
ASP
2001
Springer
13 years 9 months ago
2001
Springer
ASP
2001
Springer
13 years 9 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
ASP
2001
Springer
13 years 9 months ago
2001
Springer