Caching and non-horn inference in model elimination theorem provers

Authors:
Donald F. Geddis
Affiliations:
Stanford Univ., Stanford, CA
Venue:
Caching and non-horn inference in model elimination theorem provers
Year:
1995

Citing 0
Cited 2

Learning in BDI multi-agent systems

CLIMA IV'04 Proceedings of the 4th international conference on Computational Logic in Multi-Agent Systems
Loop elimination, a sound optimisation technique for PTTP related theorem proving

Acta Cybernetica

Quantified Score

Hi-index	0.00

Visualization

Abstract