Sciweavers

1781 search results - page 52 / 357
» Functional Answer Set Programming
Sort
View
SAC
2009
ACM
14 years 5 months ago
A comparative study of techniques to write customizable libraries
Code libraries are characterized by feature-richness — and, consequently, high overhead. The library specialization problem is the problem of obtaining a low-overhead version of...
Baris Aktemur, Sam Kamin
CORR
2002
Springer
98views Education» more  CORR 2002»
13 years 10 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
ENTCS
2002
148views more  ENTCS 2002»
13 years 10 months ago
A Declarative Debugging System for Lazy Functional Logic Programs
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
Rafael Caballero, Mario Rodríguez-Artalejo
ECAI
2000
Springer
14 years 2 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 4 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 ...