Abstract
Default reasoning plays a fundamental role in a variety of information processing applications. Default inference is inherently computationally hard and practical applications, specially time-bounded ones, may require that some notion of approximate inference be used. Anytime algorithms are a useful conceptualization of processes that may be prematurely terminated whenever necessary to return useful partial answers, with the quality of the answers improving in a well-defined manner with time. In his paper, we develop a repertoire of meaningful partial solutions for default inference problems and use these as the basis for specifying general classes of anytime default inference algorithms. We then present some of our earlier results on the connection between partial constraint satisfaction and default reasoning and exploit this connection to identify a large space of possible algorithms for default inference that may be defined based on partial constraint satisfaction techniques, which are inherently anytime in nature. The connection is useful because a number of existing techniques from the area of partial constraint satisfaction can be applied with little or no modification to default inference problems.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Marco Cadoli and Marco Schaerf. Approximate inference in default logic and circumscription. In Proc. of the Tenth European Conf. on AI, pages 319–323, 1992.
T. Dean and M. Boddy. An analysis of time-dependent planning. In Proc. of the Seventh National Conf. on AI, pages 49–54, 1988.
J. P. Delgrande and W. K. Jackson. Default logic revisited. In Proc. of the Second International Conference on the Principles of Knowledge Representation and Reasoning, pages 118–127, 1991.
Eugene C. Preuder and Richard J. Wallace. Partial constraint staisfaction. Artificial Intelligence, 58(1–3):21–70, 1992.
Aditya K. Ghose, Abdul Sattar, and Randy Goebel. Default reasoning as partial constraint satisfaction. In Proc. of the Sixth Australian Joint Conference on AI, 1993.
H.A. Kautz and B. Selman. Hard problems for simple default logics. In Proc. of the First International Conference on the Principles of Knowledge Representation and Reasoning, pages 189–197, 1989.
Dekang Lin and Randy Goebel. Computing circumscription of ground theories with theorist. Technical Report TR89-26, Department of Computing Science, University of Alberta, Edmonton, Canada, October 1989.
Steven Minton, Mark D. Johnston, Andrew B. Philips, and Philip Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58(1–3):161–205, 1992.
David Poole. A logical framework for default reasoning. Artificial Intelligence, 36:27–47, 1988.
David Poole, Randy Goebel, and Romas Aleliunas. Theorist: a logical reasoning system for defaults and diagnosis. In N.J. Cercone and G. McCalla, editors, The Knowledge Frontier: Essays in the Representation of Knowledge, pages 331–352. Springer Verlag, 1987.
Teodor C. Przymusinski. An algorithm to computer circumscription. Artificial Intelligence, 38(1):49–73, 1989.
Raymond Reiter. A logic for default reasoning. Artificial Intelligence, 13(1 and 2):81–132, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghose, A.K., Goebel, R. (1996). Anytime default inference. In: Foo, N., Goebel, R. (eds) PRICAI'96: Topics in Artificial Intelligence. PRICAI 1996. Lecture Notes in Computer Science, vol 1114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61532-6_46
Download citation
DOI: https://doi.org/10.1007/3-540-61532-6_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61532-3
Online ISBN: 978-3-540-68729-0
eBook Packages: Springer Book Archive