Title :
The inclusion of set theoretical concepts in Prolog
Author_Institution :
IBM Div. of Syst. Integration, Gaithersburg, MD, USA
Abstract :
Set-theoretical concepts, including the notion of intensional and extensional sets, are implemented in Prolog. Infinite as well as finite sets can be represented, and sets can be nested. This implementation allows for sets of lists and lists of sets. Users can specify the value of sets in a high-level sublanguage which corresponds closely to conventional logical notion, and the system automatically converts the specification to an efficient internal format. Set operations take intensional, extensional, or a mixture of intensional and extensional sets as inputs and return, if anything, a valid intensional or extensional set as output.<>
Keywords :
PROLOG; programming theory; Prolog; extensional sets; finite sets; high-level sublanguage; infinite sets; intensional sets; set theoretical concepts; Aggregates; Data engineering; Data structures; Educational institutions; Libraries; Logic programming;
Conference_Titel :
Computers and Communications, 1989. Conference Proceedings., Eighth Annual International Phoenix Conference on
Conference_Location :
Scottsdale, AZ, USA
Print_ISBN :
0-8186-1918-x
DOI :
10.1109/PCCC.1989.37440