Sciweavers

1882 search results - page 69 / 377
» Transformational Programming and Forests
Sort
View
ECAI
2006
Springer
15 years 4 months ago
On the Existence of Answer Sets in Normal Extended Logic Programs
An often problematic feature in answer set programming is that a program does not always produce an answer set, even for programs which represent default information in a seemingl...
Martin Caminada, Chiaki Sakama
97
Voted
PPDP
2007
Springer
15 years 6 months ago
Unfolding in CHR
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
Paolo Tacchella, Maurizio Gabbrielli, Maria Chiara...
182
Voted
ICLP
2009
Springer
16 years 1 months ago
Qualified Computations in Functional Logic Programming
Abstract. Qualification has been recently introduced as a generalization of uncertainty in the field of Logic Programming. In this paper we investigate a more expressive language f...
Rafael Caballero, Mario Rodríguez-Artalejo,...
ASWEC
2005
IEEE
15 years 6 months ago
A Formal Method for Program Slicing
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
Yingzhou Zhang, Baowen Xu, José Emilio Labr...
89
Voted
JUCS
2008
165views more  JUCS 2008»
15 years 16 days ago
Shortcut Fusion of Monadic Programs
: Functional programs often combine separate parts of the program using intermediate data structures for communicating results. Programs so defined are easier to understand and mai...
Cecilia Manzino, Alberto Pardo