Title
Schema-Based Transfomations of Logic Programs
Abstract
ion Selection SpecializationP1/A1Pn/AnS1/G 1Sn/G nS/G P/A8AbstractionFor each program P i (i=1, ... , n) we identify a program schema S i which describes P iabstractly. This abstraction generates a set of substitutions qi for schema variables. Thesame abstraction leads from the literals A i to the abstract literals G i . In short, theabstraction step replaces each term P i /A i by its abstraction S i /G i , and we have P i /A i =S iqi /G iqi .Selection...
Year
Venue
Field
1991
LOPSTR
Programming language,Computer science,Theoretical computer science,Schema (psychology)
DocType
Citations 
PageRank 
Conference
20
1.94
References 
Authors
4
2
Name
Order
Citations
PageRank
Norbert E. Fuchs173682.50
Markus P. J. Fromherz280457.86