1020 search results - page 36 / 204 » Tight Semantics for Logic Programs |
206
Voted
ICLP
2009
Springer
16 years 3 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...
159
Voted
ASP
2003
Springer
15 years 7 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...
118
click to vote
AAAI
2010
15 years 4 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...
136
Voted
LFCS
2007
Springer
15 years 8 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...
140
click to vote
FROCOS
2009
Springer
15 years 7 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 ...