1. Computing circumscription revisited: a reduction algorithm;Doherty;Journal of Automated Reasoning,1997
2. Computing strongest necessary and weakest sufficient conditions of first-order formulas;Doherty,2001
3. Mathematical Logic;Ebbinghaus,1984
4. Second-Order Quantifier Elimination: Foundations, Computational Aspects and Applications;Gabbay,2008
5. The extended closed world assumption and its relationship to parallel circumscription;Gelfond,1986