A predicate connection graph based logic with flexible control

  • Authors:
  • Richard Whitney;Darrel J. VanBuer;Donald P. McKay;Dan Kogan;Lynette Hirschman;Rebecca Davis

  • Affiliations:
  • System Development Corporation, Santa Monica, California and System Development Corporation, Paoli, Pennsylvania;System Development Corporation, Santa Monica, California and System Development Corporation, Paoli, Pennsylvania;System Development Corporation, Santa Monica, California and System Development Corporation, Paoli, Pennsylvania;System Development Corporation, Santa Monica, California and System Development Corporation, Paoli, Pennsylvania;System Development Corporation, Santa Monica, California and System Development Corporation, Paoli, Pennsylvania;System Development Corporation, Santa Monica, California and System Development Corporation, Paoli, Pennsylvania

  • Venue:
  • IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

The FDE has been designed to support multiple search strategies for logic programs. This machine represents the knowledge base in a strategy independent fashion as a predicate connection graph which encodes potential unifications between predicates. It facilitates knowledge representation in the language of full first order predicate calculus Immediate developments include implementation of various database access strategies and addition of evaluable predicates and functions to the language. Long-term research will focus on exploration of search strategies, especially for parallel logic machines.