229 search results - page 20 / 46 » On Reductive Semantics of Aggregates in Answer Set Programmi... |
LPNMR
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
JAVA
1999
Springer
15 years 4 months ago
1999
Springer
While class-based object-oriented programming languages provide a flexible mechanism for re-using and managing related pieces of code, they typically lack linguistic facilities fo...
109
click to vote
LOPSTR
1994
Springer
15 years 3 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
118
click to vote
RULEML
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
LPNMR
2004
Springer
15 years 5 months ago
2004
Springer
nlp is a compiler for nested logic programming under answer set semantics. It is designed as a front-end translating nested logic programs into disjunctive ones, whose answer sets ...