On strongest necessary and weakest sufficient conditions

DOI10.1016/S0004-3702(01)00070-4zbMath0971.68127OpenAlexW2104907826MaRDI QIDQ5941135

Fangzhen Lin

Publication date: 20 August 2001

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(01)00070-4

zbMATH Keywords

automated reasoningdefinabilityabduction

Mathematics Subject Classification ID

General topics in artificial intelligence (68T01)

Related Items

Progression of Decomposed Local-Effect Action Theories ⋮ Necessary and sufficient explanations for argumentation-based conclusions ⋮ On propositional definability ⋮ Semantic forgetting in answer set programming ⋮ Knowledge forgetting in propositional \(\mu\)-calculus ⋮ Computing sufficient and necessary conditions in CTL: a forgetting approach ⋮ Projection and scope-determined circumscription ⋮ Solving logic program conflict through strong and weak forgettings ⋮ Loop formulas for circumscription ⋮ First order LUB approximations: characterization and algorithms ⋮ Remedying inconsistent sets of premises ⋮ Forgetting in multi-agent modal logics ⋮ Knowledge forgetting: properties and applications ⋮ Forgetting-Based Inconsistency Measure

Uses Software

• PDDL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Abduction versus closure in causal theories.
• A logical notion of conditional independence: properties and applications
• How to progress a database
• On the Relationship Between Abduction and Deduction
• Causal diagrams for empirical research
• RST Flip-Flop Input Equations