A Predicate Connection Graph Based Logic with Flexible Control
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.
@inproceedings{ijcai1985p145,
title = {A Predicate Connection Graph Based Logic with Flexible Control},
author = {Whitney, Richard and Van Buer, Darrel J. and McKay, Donald P. and Kogan, Dan and Hirschman, Lynette and Davis, Rebecca},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {733--735},
year = {1985},
note = {Logic Programming},
url = {https://ijcai.org/proceedings/1985/145},
}
TY - CPAPER TI - A Predicate Connection Graph Based Logic with Flexible Control AU - Whitney, Richard AU - Van Buer, Darrel J. AU - McKay, Donald P. AU - Kogan, Dan AU - Hirschman, Lynette AU - Davis, Rebecca T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 733 EP - 735 UR - https://ijcai.org/proceedings/1985/145 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: