%0 Conference Paper %1 harmelen98 %A v. van Harmelen, Frank %A t. Teije, Annette %B ECAI?98 %D 1998 %K engineering approximation software reasoning %P 78--82 %T Characterising approximate problem-solving by partially fulfilled pre- and postconditions %U http://www.cs.toronto.edu/~nernst/papers/approximate-reasoning-ECAI98.pdf %X In Software Engineering, the functionality of a program is traditionally characterised by pre- and postconditions: if the preconditions are fulfilled then the postconditions are guaranteed to hold, but if the preconditions are not fulfilled, no postconditions are guaranteed at all. In this paper, we study how the functionality of a program is affected when the preconditions are only partially fulfilled. This is particularly important for heuristics AI methods which still function reasonably well (although perhaps suboptimally) under less then ideal preconditions. We introduce a framework for characterising partially fulfilled pre- and postconditions. We also present the proof obligations that must be met when using programs under partially fulfilled preconditions. We show that the classical characterisation of programs can be seen as a special case of our gradual characterisation. We illustrate our framework with two simple diagnostic algorithms which coincide in the classical approach, but which behave differently under gradually relaxed preconditions.

@inproceedings{harmelen98, abstract = {In Software Engineering, the functionality of a program is traditionally characterised by pre- and postconditions: if the preconditions are fulfilled then the postconditions are guaranteed to hold, but if the preconditions are not fulfilled, no postconditions are guaranteed at all. In this paper, we study how the functionality of a program is affected when the preconditions are only partially fulfilled. This is particularly important for heuristics AI methods which still function reasonably well (although perhaps suboptimally) under less then ideal preconditions. We introduce a framework for characterising partially fulfilled pre- and postconditions. We also present the proof obligations that must be met when using programs under partially fulfilled preconditions. We show that the classical characterisation of programs can be seen as a special case of our gradual characterisation. We illustrate our framework with two simple diagnostic algorithms which coincide in the classical approach, but which behave differently under gradually relaxed preconditions.}, added-at = {2006-03-24T16:34:33.000+0100}, author = {v. van Harmelen, Frank and t. Teije, Annette}, biburl = {https://www.bibsonomy.org/bibtex/27a16b8816b29a45a49900ff4a1c28e9f/neilernst}, booktitle = {ECAI?98}, citeulike-article-id = {121847}, description = {sdasda}, interhash = {a2eaaa36c1b297a66b028c0ce6b5d26f}, intrahash = {7a16b8816b29a45a49900ff4a1c28e9f}, keywords = {engineering approximation software reasoning}, pages = {78--82}, priority = {3}, timestamp = {2006-03-24T16:34:33.000+0100}, title = {Characterising approximate problem-solving by partially fulfilled pre- and postconditions}, url = {http://www.cs.toronto.edu/~nernst/papers/approximate-reasoning-ECAI98.pdf}, year = 1998 }