Extremal problems in logic programming and stable model computation

Bollobás, 1978 Gelfond, 1991, Classical negation in logic programs and disjunctive databases, New Generation Computing, 9, 365, 10.1007/BF03037169 Gelfond, 1988, The stable semantics for logic programs, 1070 Subrahmanian, 1995, Wfs + branch bound = stable models, IEEE Transactions on Knowledge and Data Engineering, 7, 362, 10.1109/69.390244 Niemelā, 1995, Towards efficient default reasoning, 312 Niemelā, 1995, Evaluating an algorithm for default reasoning Niemelā, 1996, Efficient implementation of the well-founded and stable model semantics Marek, 1996, Representability by default theories Dix, 1994, A classification theory of semantics of normal logic programs: II, weak properties, Fundamental Informaticae, 22, 257, 10.3233/FI-1995-2234 Cholewiński, 1995, Reasoning with stratified default theories, vol. 928