Sciweavers

1020 search results - page 94 / 204
» Tight Semantics for Logic Programs
Sort
View
LPNMR
2005
Springer
14 years 2 months ago
On Modular Translations and Strong Equivalence
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...
Paolo Ferraris
CORR
2004
Springer
97views Education» more  CORR 2004»
13 years 8 months ago
Quantum typing
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...
Benoît Valiron
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 6 months ago
A Simple Correctness Proof for Magic Transformation
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 ...
Wlodzimierz Drabent
ASPLOS
2011
ACM
13 years 17 days ago
Specifying and checking semantic atomicity for multithreaded programs
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...
Jacob Burnim, George C. Necula, Koushik Sen
DALT
2003
Springer
14 years 2 months ago
Extending the Operational Semantics of a BDI Agent-Oriented Programming Language for Introducing Speech-Act Based Communication
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...
Álvaro F. Moreira, Renata Vieira, Rafael H....