3481 search results - page 131 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
APLAS
2007
ACM
15 years 1 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...
LPNMR
2005
Springer
15 years 3 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...
100
click to vote
BIRTHDAY
2007
Springer
15 years 4 months ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
DALT
2006
Springer
15 years 1 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...
104
click to vote
JOLLI
2008
14 years 10 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...