Sciweavers

583 search results - page 48 / 117
» Preferences in Answer Set Programming
Sort
View
ICLP
1994
Springer
15 years 5 months ago
Splitting a Logic Program
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
Vladimir Lifschitz, Hudson Turner
LPNMR
2004
Springer
15 years 6 months ago
nlp: A Compiler for Nested Logic Programming
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 ...
Vladimir Sarsakov, Torsten Schaub, Hans Tompits, S...
IJCAI
2007
15 years 2 months ago
A New Perspective on Stable Models
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
DEXA
2008
Springer
113views Database» more  DEXA 2008»
15 years 3 months ago
Optimal Preference Elicitation for Skyline Queries over Categorical Domains
When issuing user-specific queries, users often have a vaguely defined information need. Skyline queries identify the most "interesting" objects for users' incomplet...
Jongwuk Lee, Gae-won You, Seung-won Hwang, Joachim...
LPNMR
2009
Springer
15 years 7 months ago
Splitting a CR-Prolog Program
CR-Prolog is an extension of A-Prolog, the knowledge representation language at the core of the Answer Set Programming paradigm. CR-Prolog is
Marcello Balduccini