From Tamil vennai (butter) → smooth, clear. Also sounds like “Venn diagram.”

Use: Run any plan through VENNI – if it’s not smooth and clear, go back.

This paper introduces several new algorithms and techniques to improve the efficiency of Answer Set Programming (ASP) solving. Specifically, it focuses on enhancing the underlying Boolean Constraint Solving (BCS) mechanisms used in ASP solvers (like Clasp, which was developed by the same authors).

The algorithms mentioned in the title are nicknames for specific techniques:

  • Zippy: An algorithm designed for efficient propagation. It aims to quickly detect when a rule becomes "active" and propagates the consequences without maintaining complex data structures for every single literal.
  • Top: A technique for handling "loops" in the dependency graph. Logic programs often have cyclic dependencies (loops), and avoiding unfounded loops is computationally expensive. "Top" refers to a method that uses top-down prompting to handle these loop checks more efficiently.

    • Fast execution checklist.

    Warning: Only use ZIPPY after VENNI + VECCI – otherwise you rush into VETTI tasks.