461 search results - page 42 / 93 » Component-Based Answer Set Programming |
124
click to vote
CORR
2002
Springer
15 years 1 months ago
2002
Springer
In this paper we consider three di erent kinds of domain dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative ...
129
click to vote
ASP
2001
Springer
15 years 5 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...
114
click to vote
JAIR
2008
15 years 1 months ago
2008
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...
134
click to vote
AI
2011
Springer
14 years 8 months ago
2011
Springer
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
142
click to vote
ICDE
2012
IEEE
13 years 4 months ago
2012
IEEE
— Uncertainties in data arise for a number of reasons: when the data set is incomplete, contains conflicting information or has been deliberately perturbed or coarsened to remov...