53 search results - page 2 / 11 » Lukaszewicz-style Answer Set Programming: A Preliminary Repo... |
AMW
2009
15 years 12 days ago
2009
In data exchange, data are materialised from a source schema to a target schema, according to suitable source-to-target constraints. Constraints are also expressed on the target sc...
101
click to vote
ENTCS
2008
14 years 11 months ago
2008
In this paper, we describe a proof-theoretic foundation for bottom-up logic programming based on uniform proofs in the setting of the logical framework LF. We present a forward un...
180
click to vote
ICLP
2009
Springer
15 years 12 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
101
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The paper introduces the notion of off-line justification for Answer Set Programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom w.r.t. a ...
AUSAI
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...