1020 search results - page 94 / 204 » Tight Semantics for Logic Programs |
111
Voted
LPNMR
2005
Springer
15 years 8 months ago
2005
Springer
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
146
click to vote
CORR
2004
Springer
15 years 2 months ago
2004
Springer
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda-calculus for the QRAM model, following the work of P. Seling...
117
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
123
Voted
ASPLOS
2011
ACM
14 years 6 months ago
2011
ACM
In practice, it is quite difficult to write correct multithreaded programs due to the potential for unintended and nondeterministic interference between parallel threads. A funda...
135
click to vote
DALT
2003
Springer
15 years 7 months ago
2003
Springer
Work on agent communication languages has since long striven to achieve adequate speech act semantics; partly, the problem is that references to an agent’s architecture (in parti...