On strongest necessary and weakest sufficient conditions

Artificial Intelligence

Volumn 128, Issue 1-2, 2001, Pages 143-159

  Lin, Fangzhen ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Abduction; Automated reasoning; Definability

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; DECISION THEORY;

AUTOMATED REASONING; PROPOSITIONAL THEORY;

ARTIFICIAL INTELLIGENCE;

EID: 0035336688     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00070-4     Document Type: Article

References (23)

1. Reasoning by regression: Pre- and postdiction procedures for logics of action and change with nondeterminism
2. On the relationship between abduction and deduction
3. A logical notion of conditional independence: Properties and applications
4. Compiling knowledge into decomposable negation normal form
5. Abduction versus closure in causal theories
6. Two forms of dependence in propositional logic: Controllability and definability
7. Embracing causality in specifying the indirect effects of actions
8. From causal theories to successor state axioms: Bridging the gap between nonmonotonic action theories and STRIPS-like formalisms
9. How to progress a database
10. Forget it!
11. Causal diagrams for empirical research
12. Representing knowledge for logic-based diagnosis
13. Explanation and prediction: An architecture for default and abductive reasoning
14. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression
15. Foundations of ATMS
16. Abductive and default reasoning: A computational core
17. Causal ordering and identifiability
18. Generalized consensus theory and application to the minimization of boolean functions
19. Updating propositional formulas