Sciweavers

1963 search results - page 33 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
ICLP
2003
Springer
15 years 7 months ago
Uniform Equivalence of Logic Programs under the Stable Model Semantics
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
Thomas Eiter, Michael Fink
AI
2011
Springer
14 years 9 months ago
Stable models and circumscription
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
131
Voted
LPNMR
2009
Springer
15 years 9 months ago
Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs
Configurable on chip multiprocessor systems combine advantages of task-level parallelism and the flexibility of field-programmable devices to customize architectures for paralle...
Harold Ishebabi, Philipp Mahr, Christophe Bobda, M...
123
Voted
DEXA
2008
Springer
113views Database» more  DEXA 2008»
15 years 4 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...
123
Voted
ACL
1990
15 years 3 months ago
Multiple Underlying Systems: Translating User Requests into Programs to Produce Answers
A user may typically need to combine the strengths of more than one system in order to perform a task. In this paper, we describe a component of the Janus natural language interfa...
Robert J. Bobrow, Philip Resnik, Ralph M. Weisched...