• Fangzhen Lin and Yuting Zhao. ASSAT: Computing answer sets of a logic program by SAT solvers In Proc. of AAAI-02.
  • Fangzhen Lin Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic In Proc. of KR-02.
  • P.A. Bonatti. Reasoning with infinite stable models. Proc. of the 17th Int. Joint Conf. on Artificial Intelligence (IJCAI'01), pp. 603-608, Morgan Kaufmann, 2001. [PDF]
  • P.A. Bonatti. Reasoning with open logic programs. Proc. of 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01), pp 147-159, LNAI 2173, 2001. [Abstract and PDF]
  • P.A. Bonatti. Prototypes for Reasoning with Infinite Stable Models and Function Symbols. Proc. of 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01), pp 416-419, LNAI 2173, 2001. [Abstract and PDF]
  • Marcello Balduccini and Michael Gelfond. Logic Programs with Consistency-Restoring Rules. In AAAI Spring 2003 Symposium, 2003.
    (Postscript, gzipped Postscript, PDF)
  • M. Gelfond and N. Leone: Logic Programming and Knowledge Representation -- A-Prolog perspective (pdf version)
  • M. Gelfond, M. Balduccini, J. Galloway: Diagnosing physical systems in A-Prolog
  • M. Gelfond: Representing Knowledge in A-Prolog (pdf version)
  • M.Balduccini, M.Gelfond, M.Nogueira, R.Watson,M.Barry: An A-Prolog decision support system. for the space shuttle
  • M.Balduccini, M.Gelfond, M.Nogueira: "A-Prolog as a tool for declarative programming", Proceedings of the 12th International Conference on Software Engineering and Knowledge Engineering (SEKE'2000)
  • Chiaki Samka:  Learning by Answer sets.   Proceedings of the AAAI Spring Symposium on Answer Set Programming, Technical Report SS-01-01, AAAI Press, pages 181-187, 2001.
  • G. Brewka: Answer Sets and Qualitative Decision Making, Synthese, to appear 2003
  • G. Brewka, I. Niemelä, M. Truszczynski: Answer Set Optimization, submitted for publication
  • G. Brewka, I. Niemelä, T. Syrjänen: Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs, Proc. JELIA 2002, Springer Verlag, 2002
  • Special Issue on Answer Set Programming, Theory and practice of logic programming,  guest editors: Chitta Baral, Ale Provetti and Tran Cao Son
    • A semantic framework for preference handling in answer set programming,
      Torsten Schaub and Kewen Wang
    • On the expressibility of stable logic programming,
      Victor W. Marek and Jeffrey B. Remmel
    • Diagnostic reasoning with A-Prolog,  
      Marcello Balduccini and Michael Gelfond (Postscript, gzipped Postscript, PDF)
    • Tight logic programs,
      Esra Erdem and Vladimir Lifschitz
    • Answer Sets for Consistent Query Answering in Inconsistent Databases,
      Marcelo Arenas, Leopoldo Bertossi, Jan Chomicki
    • Bounded LTL model checking with stable models,
      Keijo Heljanko and Ilkka Niemela
    • Computing preferred answer sets by meta-interpretation in answer set programming,
      Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer