Answer Set Programming (ASP) and Logic Programming represent key paradigms in contemporary computer science, particularly in the field of artificial intelligence.

In this paper we present a sequent calculus for propositional dynamic logic built using an enriched version of the tree-hypersequent method and including an infinitary rule for the iteration operator.

Schemata have played important roles in logic since Aristotle's Prior Analytics. The syllogistic figures and moods can be taken to be argument schemata as can the rules of the Stoic propositional ...