Name
Abstract | ||
|---|---|---|
The folding transformation plays an important role as well in the process of improving programs by transformations [TS84,BD77]
as in performing proofs [SM88,BM79]. The success of the folding of an initial member (conjunctions of atoms) in an other obtained
from it after applying some unfoldings is in general not decidable [PP89b]. This problem was studied in the context of transforming
logic programs for quite restrictive specifications (members and programs) [PP89b,Ale92]. We propose in this paper a comparison
between the different approaches for resolving the folding problem, and we propose an extension in order to deal with more
general specifications.
|
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/978-3-540-48765-4_65 | IEA/AIE |
Keywords | Field | DocType |
folding technique,inductive proof | Logic program,Discrete mathematics,Program transformation,Computer science,Theoretical computer science,Decidability,Mathematical proof,Artificial intelligence | Conference |
Volume | ISSN | ISBN |
1611 | 0302-9743 | 3-540-66076-3 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
2 | ||