Sciweavers

580 search results - page 50 / 116
» On the Foundations of Answer Set Programming
Sort
View
CORR
2002
Springer
98views Education» more  CORR 2002»
13 years 8 months ago
A Framework for Compiling Preferences in Logic Programs
We introduce a methodology and framework for expressing general preference information in logic programming under the answer set semantics. An ordered logic program is an extended...
James P. Delgrande, Torsten Schaub, Hans Tompits
ECAI
2000
Springer
14 years 1 months ago
Logic Programs with Compiled Preferences
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
James P. Delgrande, Torsten Schaub, Hans Tompits
VL
2008
IEEE
111views Visual Languages» more  VL 2008»
14 years 3 months ago
Tool support for working with sets of source code entities
Previous research has identified several challenges that programmers face in answering questions about a code base. To explore ways to overcome those challenges, we have develope...
Curtis Fraser, Chris Luce, Jamie Starke, Jonathan ...
LICS
1994
IEEE
14 years 25 days ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer
AAAI
2010
13 years 10 months ago
Ordered Completion for First-Order Logic Programs on Finite Structures
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou