6554 search results - page 238 / 1311 » Constraint Logic Programming |
170
click to vote
ASIAN
1999
Springer
15 years 10 months ago
1999
Springer
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...
208
click to vote
JELIA
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Among others, Alferes et al. (1998) presented an approach for updating logic programs with sets of rules based on dynamic logic programs. We syntactically redefine dynami...
185
click to vote
TCS
2008
15 years 6 months ago
2008
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...
173
click to vote
KR
2004
Springer
15 years 12 months ago
2004
Springer
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
148
click to vote
SUM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of infor...