Sciweavers

1882 search results - page 159 / 377
» Transformational Programming and Forests
Sort
View
ICLP
1999
Springer
15 years 2 months ago
Bounded Nondeterminism of Logic Programs
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
Dino Pedreschi, Salvatore Ruggieri
ESOP
2005
Springer
15 years 3 months ago
A New Foundation for Control-Dependence and Slicing for Modern Program Structures
The notion of control dependence underlies many program analysis and transformation techniques used in numerous applications. Despite wide application, existing definitions and ap...
Venkatesh Prasad Ranganath, Torben Amtoft, Anindya...
LPAR
1999
Springer
15 years 2 months ago
A Partial Evaluation Framework for Curry Programs
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
Elvira Albert, María Alpuente, Michael Hanu...
CP
1998
Springer
15 years 2 months ago
A Framework for Assertion-Based Debugging in Constraint Logic Programming
Abstract. We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of pr...
Germán Puebla, Francisco Bueno, Manuel V. H...
CORR
2010
Springer
67views Education» more  CORR 2010»
14 years 10 months ago
Similarity-based Reasoning in Qualified Logic Programming
Similarity-based Logic Programming (briefly, SLP) has been proposed to enhance the LP paradigm with a kind of approximate reasoning which supports flexible information retrieval a...
Rafael Caballero, Mario Rodríguez-Artalejo,...