In this paper we present the first automatic technique for symbolically proving alternation-free μ-calculus properties of infinitestate, higher-order programs. In particular, we show how weak-recurrence solvability can be lifted from finite-state programs to higher-order recursive programs. Our strategy reduces the search for a proof of a winning strategy to nontermination of higher-order progr...

Swine production facilities in the United States have adopted technological advancements in response to problems and opportunities as they arise. The first pressure was due mostly to economics. To improve feed efficiency, animals were moved into climate controlled buildings. To reduce labor costs, manure was handled as a liquid through slatted floors and feed and water systems were automated. L...

A new xpoint semantics for abductive logic programs is provided, in which the generalized stable models of an abductive program are characterized as the xpoint of a disjunctive program obtained by a suitable program transformation. In the transformation, both negative hypotheses through negation as failure and positive hypotheses from the abducibles are dealt with uniformly. This characterizati...

In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow default negation not only in rule bodies but also in their heads.We start by introducing the notion of an update P U of a logic program P by another logic program U . Subsequently, we provide a precise semantic character...