作者: Fangzhen Lin
DOI: 10.1016/S0004-3702(01)00070-4
关键词:
摘要: Abstract Given a propositional theory T and proposition q , sufficient condition of is one that will make true under necessary has to be for . In this paper, we propose notion strongest weakest conditions. Intuitively, the most general consequence can deduce from given theory, abduction theory. We show these two conditions are dual ones, naturally extended arbitrary formulas. investigate some computational properties discuss their potential applications.