Sciweavers

169 search results - page 4 / 34
» Semantic forgetting in answer set programming
Sort
View
LPNMR
2009
Springer
14 years 2 months ago
Translating Preferred Answer Set Programs to Propositional Logic
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
Vernon Asuncion, Yan Zhang
ICLP
2009
Springer
14 years 8 months ago
Merging Logic Programs under Answer Set Semantics
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...
DKE
2010
167views more  DKE 2010»
13 years 7 months ago
The consistency extractor system: Answer set programs for consistent query answering in databases
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
Mónica Caniupán Marileo, Leopoldo E....
ASP
2005
Springer
14 years 1 months ago
Debugging Logic Programs under the Answer Set Semantics
This paper discusses the background, algorithms and implementation techniques to support programmers in ‘debugging’ logic programs under the answer set semantics. We first inv...
Martin Brain, Marina De Vos