3535 search results - page 86 / 707 » Logic Program Specialisation |
121
click to vote
APLAS
2007
ACM
15 years 7 months ago
2007
ACM
Abstract. This paper provides a call-by-name and a call-by-value calculus, both of which have a Curry-Howard correspondence to the minimal normal logic K. The calculi are extension...
135
Voted
LPNMR
2005
Springer
15 years 9 months ago
2005
Springer
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
145
Voted
POPL
2010
ACM
16 years 26 days ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
119
Voted
DALT
2006
Springer
15 years 7 months ago
2006
Springer
We outline elements of the Abstract Contract Calculator, a prototype language implemented in Haskell (a declarative programming language) in which we simulate agents executing abst...
154
click to vote
JOLLI
2008
15 years 3 months ago
2008
This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statemen...