Abstract
Let us reconsider the Tweety example: Tweety is a bird. Birds typically fly. In this example, query: Does Tweety fly? should fail, because it asks whether some kernel knowledge is present, and that knowledge is simply not there. However, a weaker question may be asked: Is there any justification such that Tweety flies under that justification? This weaker query will succeed, and compute the corresponding justification (Tweety flies). Thus, since we shall need to use justifications as objects of computation, one needs to have a way of referring to these objects. In other words, one needs justification variables. Also, from a practical point of view, it is annoying to have to specify from the very start the number of justification variables to be used in a given computation. It is more convenient to be able to ask: Are there any justifications such that under those justifications, Tweety flies ? Whence the slightly modified infinitary version of the language of PIL used in this chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Abdallah, A.N. (1995). Partial Information Ionic Logic Programming. In: The Logic of Partial Information. Monographs in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78160-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-78160-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-78162-9
Online ISBN: 978-3-642-78160-5
eBook Packages: Springer Book Archive