4192 search results - page 118 / 839 » Probabilistic Logic Programming |
133
click to vote
ECSQARU
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. Whereas every formula is a theorem for inconsistent set...
130
click to vote
HIS
2004
15 years 3 months ago
2004
Many researchers have observed that neurons process information in an imprecise manner - if a logical inference emerges from neural computation, it is inexact at best. Thus, there...
227
click to vote
POPL
2008
ACM
16 years 2 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
111
click to vote
FOSSACS
1999
Springer
15 years 6 months 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...
112
click to vote
ENTCS
2006
15 years 2 months ago
2006
Partial functions and operators are used extensively in the formal development of programs and thus development methods have to clarify how to reason about them. There are a numbe...