Reasoning about action II: the qualification problem

摘要: Abstract We present a computationally effective approach to representing and reasoning about actions with many qualifications. The involves treating as qualified not by specific facts that may or hold when the action is executed, but instead potentially general constraints describing domain being investigated. Specifically, we suggest result of be computed without considering these qualifying constraints, take if only any violated after computation complete. Our presented using framework developed in [6], where discussed solution frame ramification problems based on notion possible worlds, compared computational requirements needs more conventional ones. In paper, show constraint qualification, coupled worlds described earlier, has remarkable property essentially no resources are required confirm an unqualified. As before, also make quantitative comparison between needed our those other formulations.