Sciweavers

740 search results - page 57 / 148
» Open Answer Set Programming with Guarded Programs
Sort
View
JELIA
2010
Springer
13 years 7 months ago
A Dynamic-Programming Based ASP-Solver
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...
Michael Morak, Reinhard Pichler, Stefan Rümme...
LPNMR
2005
Springer
14 years 2 months ago
On Modular Translations and Strong Equivalence
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...
Paolo Ferraris
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 4 months ago
Lower bound for deterministic semantic-incremental branching programs solving GEN
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...
Dustin Wehr
CLIMA
2004
13 years 10 months ago
Revising Knowledge in Multi-agent Systems Using Revision Programming with Preferences
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...
Inna Pivkina, Enrico Pontelli, Tran Cao Son
SIGSOFT
2003
ACM
14 years 10 months ago
ARCHER: using symbolic, path-sensitive analysis to detect memory access errors
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...
Yichen Xie, Andy Chou, Dawson R. Engler