Sciweavers

3572 search results - page 166 / 715
» Nominal Logic Programming
Sort
View
ICLP
1997
Springer
15 years 5 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
107
Voted
PODS
1991
ACM
98views Database» more  PODS 1991»
15 years 4 months ago
Minimum and Maximum Predicates in Logic Programming
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...
Sumit Ganguly, Sergio Greco, Carlo Zaniolo
91
Voted
TGC
2007
Springer
15 years 7 months ago
Elimination of Ghost Variables in Program Logics
Abstract. Ghost variables are assignable variables that appear in program annotations but do not correspond to physical entities. They are used to facilitate specification and ver...
Martin Hofmann, Mariela Pavlova
LPNMR
2004
Springer
15 years 6 months ago
Planning with Preferences Using Logic Programming
Abstract. We present a declarative language, PP, for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allow...
Tran Cao Son, Enrico Pontelli
101
Voted
ICLP
2005
Springer
15 years 6 months ago
A Generic Framework for the Analysis and Specialization of Logic Programs
The relationship between abstract interpretation and partial deduction has received considerable attention and (partial) integrations have been proposed starting from both the part...
Germán Puebla, Elvira Albert, Manuel V. Her...