Inferring answers to queries

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Inferring answers to queries

Full text

Pdf (2.08 MB)

Source

Annual Workshop on Computational Learning Theory archive
Proceedings of the tenth annual conference on Computational learning theory table of contents

Nashville, Tennessee, United States

Pages: 275 - 284

Year of Publication: 1997

ISBN:0-89791-891-6

Authors

William I. Gasarch	Institute of Advanced Computer Studies and Department of Computer Science, University of Maryland, College Park, MD
Andrew C. Y. Lee	Department of Mathematics, University of Maryland, College Park, MD

Sponsors

AT&T Labs :
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Vanderbilt University : Vanderbilt University

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 17, Downloads (12 Months): 27, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/267460.267512 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Büchi60	J.R. Buchi. Weak second order arithmetic and finite automata. Zeitsch. f. math. Logik und Grundlagen d. Math., 6:66-92, 1960.
	Büchi62	J.R. Buchi. On a decision method in restricted second order arithmetic. In E. Nagel et al., editors, Logic Methodology and Philosophy of Science, pages 1-11. Stanford University Press, 1962.
	COLT95	COLT. Proc. 8 th Annual ACM Conference on Computational learning theory, 1995.
	AS83	Dana Angluin , Carl H. Smith, Inductive Inference: Theory and Methods, ACM Computing Surveys (CSUR), v.15 n.3, p.237-269, Sept. 1983 [doi>10.1145/356914.356918]
	BCJS94	Ganesh Baliga , John Case , Sanjay Jain , Mandayam Suraj, Machine learning of higher-order programs, Journal of Symbolic Logic, v.59 n.2, p.486-500, June 1994 [doi>10.2307/2275402]
	Cho74	Y. Choueka. Theory of automata on w-tapes. Journal of Computer and System Sciences, 8:117-142, 1974.
	CJS92	J. Case, S. Jain, and A. Sharma. On learning limiting programs. Internat. J. Found. Comput. Sci, 3(1):93-115, 1992.
	CKSS97	John Case , Efim B. Kinber , Arun Sharma , Frank Stephan, On the Classification of Computable Languages, Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, p.225-236, February 27-March 01, 1997
	CS83	J. Case and C.H. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193- 220, 1983.
	CS96	J. Case and F. Stephan. Private communication, May 1996.
	Dal83	R. Daley. On the error correcting power of pluralism in bc-type inductive inference. Theoretical Computer Science, 24(1):95-104, 1983.
	DKV95	Robert Daly , Bala Kalyanasundaram , Mahendran Velauthapillai, Breaking the probability 12 barrier in FIN-type learning, Journal of Computer and System Sciences, v.50 n.3, p.574-599, June 1995 [doi>10.1006/jcss.1995.1045]
	ER66	C.C. Elgot and M. 0. Rabin. Decidability and undecidability of extensions of second (first) order theory of (generalized) successor. The Journal of Symbolic Logic, 31:169- 181, 1966.
	GH95	William Gasarch , Geoffrey R. Hird, Reductions for learning via queries, Proceedings of the eighth annual conference on Computational learning theory, p.152-161, July 05-08, 1995, Santa Cruz, California, United States [doi>10.1145/225298.225316]
	GS92	William I. Gasarch , Carl H. Smith, Learning via queries, Journal of the ACM (JACM), v.39 n.3, p.649-674, July 1992 [doi>10.1145/146637.146670]
	GS97	W.I. Gasarch and C. H. Smith. A survey of inductive inference with an emphasis on queries. In A. Sorbi, editor, Complexity, Logic, and Recursion Theory, number 187 in Lecture notes in Pure and Applied Mathematics Series. M. Dekker., 1997.
	Smi82	Carl H. Smith, The Power of Pluralism for Automatic Program Synthesis, Journal of the ACM (JACM), v.29 n.4, p.1144-1165, Oct. 1982 [doi>10.1145/322344.322356]
	Smi94	Carl H. Smith, A recursive introduction to the theory of computation, Springer-Verlag New York, Inc., Secaucus, NJ, 1994
	Soa87	Robert I. Soare, Recursively enumerable sets and degrees, Springer-Verlag New York, Inc., New York, NY, 1987
	Ste95	Frank Stephan, Learning via queries and oracles, Proceedings of the eighth annual conference on Computational learning theory, p.162-169, July 05-08, 1995, Santa Cruz, California, United States [doi>10.1145/225298.225317]
	SW95	C. Smith and R. Wiehagen. Generalization versus classification. Journal of Experimental and Theoretical Artificial Intelligence, 7:163- 174, 1995.
	SWZ94	Rolf Wiehagen , Carl H. Smith , Thomas Zeugmann, Classification of predicates and languages, Proceedings of the first European conference on Computational learning theory, p.171-181, October 1994, Royal Holloway, Univ. of London, United Kingdom