182 search results - page 14 / 37 » Reformulation of Global Constraints in Answer Set Programmin... |
107
click to vote
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
CLIMA
2004
15 years 1 months ago
2004
In this paper we extend the Revision Programming framework--a logic-based framework to express and maintain constraints on knowledge bases-with different forms of preferences. Pref...
102
click to vote
ASP
2001
Springer
15 years 3 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...
ICLP
2004
Springer
15 years 5 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
190
click to vote
ICLP
2009
Springer
16 years 9 days ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...