FINDER: Finite domain enumerator system description

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 814 LNAI, Issue , 1994, Pages 798-801

  Slaney, John ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85026901453     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58156-1_63     Document Type: Conference Paper

References (5)

1. M. Fujita, J. Slaney & F. Bennett, Automatic Generation of Some Results in Finite Algebra, Proc. 13th IJCAI, 1993, pp. 52-57.
2. J. Slaney, SCOTT: A Model-Guided Theorem Prover, Proc. 13th IJCAI, 1993, pp. 109-114.
3. J. Slaney, FINDER, Finite Domain Enumerator: Version 2.0 Notes and Guide, Technical report TR-ARP-1/92, Automated Reasoning Project, Australian National University, Canberra, 1992.
4. J. Slaney, FINDER, Finite Domain Enumerator: Version 3.0 Notes and Guide, Document with program sources, anonymous ftp, arp.anu.edu.au, file ARP/FINDER/flnder-3.0.1.tar.Z.
5. J. Slaney, M. Stickel & M. Fujita, Automated Reasoning and Exhaustive Search: Quasigroup Existence Problems, Computers and Mathematics with Applications, Special Issue on Automated Reasoning and Its Applications, to appear 1994.