Sciweavers

229 search results - page 24 / 46
» On Reductive Semantics of Aggregates in Answer Set Programmi...
Sort
View
ASP
2005
Springer
15 years 8 months ago
Intelligence Analysis Using Quantitative Preferences
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
FQAS
2004
Springer
122views Database» more  FQAS 2004»
15 years 6 months ago
Simplification of Integrity Constraints with Aggregates and Arithmetic Built-Ins
In the context of relational as well as deductive databases, correct and efficient integrity checking is a crucial issue, as, without any guarantee of data consistency, the answers...
Davide Martinenghi
JAR
2007
142views more  JAR 2007»
15 years 3 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
DALT
2009
Springer
15 years 9 months ago
Playing with Rules
Abstract. In this paper we revisit Logic Programming under the answer-set semantics - or Answer-Set Programming - and its extension Evolving Logic Programming, two languages that u...
João Leite
SLP
1994
89views more  SLP 1994»
15 years 4 months ago
Signed Logic Programs
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
Hudson Turner