On strongest necessary and weakest sufficient conditions
From MaRDI portal
Publication:5941135
DOI10.1016/S0004-3702(01)00070-4zbMath0971.68127MaRDI QIDQ5941135
Publication date: 20 August 2001
Published in: Artificial Intelligence (Search for Journal in Brave)
68T01: General topics in artificial intelligence
Related Items
Projection and scope-determined circumscription, Remedying inconsistent sets of premises, Knowledge forgetting: properties and applications, On propositional definability, Semantic forgetting in answer set programming, Solving logic program conflict through strong and weak forgettings, Loop formulas for circumscription, First order LUB approximations: characterization and algorithms
Uses Software
Cites Work