3572 search results - page 81 / 715 » Nominal Logic Programming |
114
Voted
ECSQARU
2005
Springer
15 years 6 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...
203
Voted
POPL
2008
ACM
16 years 26 days 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...
98
Voted
FOSSACS
1999
Springer
15 years 4 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...
101
click to vote
ENTCS
2006
15 years 17 days 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...
103
Voted
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
Lax logical relations are a categorical generalisation of logical relations; though they preserve product types, they need not preserve exponential types. But, like logical relatio...