39 search results - page 4 / 8 » Tutorial on Specialisation of Logic Programs |
LPAR
1994
Springer
13 years 11 months ago
1994
Springer
In this paper we develop a generic declarative diagnoser for normal logic programs that is based on tree search. The soundness and the completeness of the diagnoser are proved. The...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
We are witnessing an exciting revival of interest in recursive Datalog queries in a variety of emerging application domains such as data integration, information extraction, netwo...
TCS
2008
13 years 7 months ago
2008
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...
WLP
1997
Springer
13 years 11 months ago
1997
Springer
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...
ESOP
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most ...