Well Founded Semantics as Two dimensional Here and There

This workpresents a newlogical characterization of well foundedsemanticsthat provides, as interesting innovation, a fully semantic-oriented treatment of programconnectives without relying on any syntactic restriction or transformation. Ourworkis inspired by a recent research line whichhas established a nice correspondencebetweenstable modelsand a particular minimization for the monotoniclogic of here-and-there. We identify a generalization of the latter (wehavecalled two-dimensionalhere-and-there) that captures Przymusinki’s 3-valued stable modelsand showthat, as in the 2-valued case, the here-and-there version is more economicalin the set of modelsinvolved in the minimization process.

• Type: Conference
• Year: 2001
• Where: ASP
• Authors: Pedro Cabalar
• Keywords: ASP 2001, Automated Reasoning, Nice Correspondencebetweenstable Modelsand, Particular Minimization, Stable Modelsand Showthat