1117 search results - page 36 / 224 » Partial Models of Extended Generalized Logic Programs |
LANMR
2004
13 years 10 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...
SEMWEB
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
FOSSACS
1999
Springer
14 years 28 days ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
There are numerous applications where we have to deal with temporal uncertainty associated with events. The Temporal Probabilistic (TP) Logic Programs should provide support for v...
CAV
2008
Springer
13 years 10 months ago
2008
Springer
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...