Sciweavers

21 search results - page 1 / 5
» Dynamic Magic Sets for Disjunctive Datalog Programs
Sort
View
ICLP
2010
Springer
13 years 8 months ago
Dynamic Magic Sets for Disjunctive Datalog Programs
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
Mario Alviano
JAR
2007
142views more  JAR 2007»
13 years 4 months ago
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
DKE
2010
167views more  DKE 2010»
13 years 4 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....
SUM
2007
Springer
13 years 10 months ago
The Consistency Extractor System: Querying Inconsistent Databases Using Answer Set Programs
Abstract. We present the Consistency Extractor System (ConsEx) that uses answer set programming to compute consistent answers to first-order queries posed to relational databases ...
Mónica Caniupán Marileo, Leopoldo E....
LPNMR
1999
Springer
13 years 8 months ago
On the Role of Negation in Choice Logic Programs
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
Marina De Vos, Dirk Vermeir