1020 search results - page 17 / 204 » Tight Semantics for Logic Programs |
IAT
2008
IEEE
14 years 2 months ago
2008
IEEE
In this work we introduce the first steps towards the definition of an answer set semantics for residuated logic programs with negation.
CL
2000
Springer
13 years 7 months ago
2000
Springer
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...
ICLP
1992
Springer
13 years 11 months ago
1992
Springer
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
SUM
2009
Springer
14 years 2 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...
LANMR
2004
13 years 9 months ago
2004
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...