On strongest neccessary and weakest sufficient conditions

作者: 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.

参考文章(16)
Andreas Weber, Updating Propositional Formulas. Expert Database Conf.. pp. 487- 500 ,(1986)
Herbert A. Simon, Causal Ordering and Identifiability Springer, Dordrecht. pp. 53- 80 ,(1977) , 10.1007/978-94-010-9521-1_5
Raymond Reiter, The frame problem in situation the calculus: a simple solution (sometimes) and a completeness result for goal regression Artificial intelligence and mathematical theory of computation. pp. 359- 380 ,(1991) , 10.1016/B978-0-12-450010-5.50026-8
David Poole, Representing Knowledge for Logic-Based Diagnosis. Future Generation Computer Systems. pp. 1282- 1290 ,(1988)
Marcus Bjareland, Lars Karlsson, Reasoning by regression: pre-and postdiction procedures for logics of action and change with nondeterminism international joint conference on artificial intelligence. pp. 1420- 1425 ,(1997)
Adnan Darwiche, Compiling knowledge into decomposable negation normal form international joint conference on artificial intelligence. pp. 284- 289 ,(1999)
Fangzhen Lin, Embracing causality in specifying the indirect effects of actions international joint conference on artificial intelligence. pp. 1985- 1991 ,(1995)
Kurt Konolige, Abduction versus closure in causal theories Artificial Intelligence. ,vol. 53, pp. 255- 272 ,(1992) , 10.1016/0004-3702(92)90073-7
Fangzhen Lin, Ray Reiter, How to progress a database Artificial Intelligence. ,vol. 92, pp. 131- 167 ,(1997) , 10.1016/S0004-3702(96)00044-6
Adnan Darwiche, A logical notion of conditional independence: properties and applications Artificial Intelligence. ,vol. 97, pp. 45- 82 ,(1997) , 10.1016/S0004-3702(97)00042-8