1020 search results - page 36 / 204 » Tight Semantics for Logic Programs |
ICLP
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Qualification has been recently introduced as a generalization of uncertainty in the field of Logic Programming. In this paper we investigate a more expressive language f...
ASP
2003
Springer
14 years 2 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
AAAI
2010
13 years 10 months ago
2010
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
LFCS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
FROCOS
2009
Springer
14 years 1 months ago
2009
Springer
We discuss a new concept of agent programs that combines logic programming with reasoning about actions. These agent logic programs are characterized by a clear separation between ...