Guarded Open Answer Set Programming with Generalized Literals

Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infinity axioms - EPs that have but infinite answer sets. However, reasoning under the open answer set semantics, in particular satisfiability checking of a predicate w.r.t. a program, is already undecidable for programs without generalized literals. In order to regain decidability, we restrict the syntax of EPs such that both rules and generalized literals are guarded. Via a translation to guarded fixed point logic (

• Type: Conference
• Year: 2006
• Where: FOIKS
• Authors: Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
• Keywords: Answer Set Semantics, FOIKS 2006, Information Management, Open Answer, Satisfiability Checking