Abstract. We present a novel system for propositional Answer-Set Programming (ASP). This system, called dynASP, is based on dynamic programming and thus significantly differs fro...
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
In this paper we extend the Revision Programming framework--a logic-based framework to express and maintain constraints on knowledge bases-with different forms of preferences. Pref...
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...