Proceedings

A Predicate Connection Graph Based Logic with Flexible Control

Download BibTeX Cite

Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Logic Programming. Pages 733-735.

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 pred1cate 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 parallellogic machines.

Richard Whitney, Darrel J. Van Buer, Donald P. McKay, Dan Kogan, Lynette Hirschman, and Rebecca Davis. 1985. A Predicate Connection Graph Based Logic with Flexible Control. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85. IJCAI, 733–735. https://ijcai.org/proceedings/1985/145
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards