The common order-theoretic structure of version spaces and ATMSs

Artificial Intelligence

Volumn 95, Issue 2, 1997, Pages 357-407

  Gunter, Carl A ^a   Ngair, Teow Hin ^b   Subramanian, Devika ^c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c RICE UNIVERSITY   (United States)

Author keywords

Admissibility; Anti chains; ATMS; Concept learning; Label update algorithms; Partial orders; Truth maintenance; Version spaces

Indexed keywords

KNOWLEDGE REPRESENTATION; LEARNING ALGORITHMS; OPTIMIZATION; SET THEORY;

ASSUMPTION BASED TRUTH MAINTENANCE SYSTEM; LABEL UPDATE ALGORITHMS; VERSION SPACES;

ARTIFICIAL INTELLIGENCE;

EID: 0031221767     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(97)00033-7     Document Type: Article

References (15)

1. B.A. Davey and H.A. Priestley, Introduction to Lattices and Order (Cambridge University Press, Cambridge, MA, 1990).
2. J. de Kleer, An assumption-based TMS, Artificial Intelligence 28 (1986) 127-162.
3. J. de Kleer, Extending the ATMS, Artificial Intelligence 28 (1986) 163-196.
4. K.D. Forbus and J. de Kleer, Building Problem Solvers (MIT Press, Cambridge, MA, 1993).
5. Y. Fujiwara, Y. Mizushima and S. Honiden, On logical foundations of the ATMS, in: Proceedings ECAI-90 Workshop on Truth Maintenance Systems, Stockholm, Sweden (1990).
6. C.A. Gunter, Semantics of Programming Languages: Structures and Techniques, Foundations of Computing (MIT Press, Cambridge, MA, 1992).
7. H. Hirsh, Incremental Version Space Merging: A General Framework for Concept Learning (Kluwer Academic Publishers, Dordrecht, Netherlands, 1990).
8. C. Mellish, The description identification problem, Artificial Intelligence 52 (1991) 151-167.
9. T.M. Mitchell, The need for biases in generalization, in: J. Shavlik and T. Dietterich, eds., Readings in Machine Learning (Morgan Kaufmann, Los Altos, CA, 1990).
10. T.M. Mitchell, Version Space: an approach to concept leaning, Ph.D. Thesis, Stanford University, Stanford, CA (1978).
11. T.-H. Ngair, Convex spaces as an order-theoretic basis for problem solving, Ph.D. Thesis, University of Pennsylvania, Philadelphia, PA (1992).
12. D.S. Scott and C. Strachey, Towards a mathematical semantics for computer languages, in: J. Fox, ed., Computers and Automata (Polytechnic Institute of Brooklyn Press, 1971) 19-46.
13. J. Simon, On some central problems in computational complexity, Ph.D. Thesis, Cornell University, Ithaca, NY (1975).
14. M. Smyth, The largest cartesian closed category of domains, Theoret. Comput. Sci. 27 (1983) 109-119.
15. S. Vickers, Topology via Logic, Tracts in Theoretical Computer Science, Vol. 5 (Cambridge University Press, Cambridge, MA, 1989).