Following are a list of new results for which I plan to add short notes in a
style similar to the book.

•     Computation of answer sets by compiling logic programs to its completion plus some loop formulas. (Used in the ASSET system of Lin et  al.)
•     Extension of the above to the disjunctive case. (By Lee and Lifschitz, ICLP'03)
•     Weaker versions of tightness (You et al. IJCAI'03); converting non-tight programs to tight programs (Lin and Zhao, IJCAI'03)
•     Finitary programs: A class of programs with function symbols whose answer sets are finited, and for which answer sets can still be computed in a bottom-up manner. (A formulation by Bonatti.)
•     Encoding of ordered logic programs in AnsProlog (Brewka et al's work)
•     Encoding of w-answer sets etc using AnsProlog (work by Wang & Schaub)
•     Aggregates  (DLV).
•     Learning AnsProlog rules (Work by Sakama, Otero, etc.)
•     Encoding of planning with domain constraints (By Dix et al.)
•     Probabilistic programming using answer sets.
•     Consistency restoring extension. (CR-Prolog and CR2-Prolog) (By TTU group)