ACM DL

Computational Logic (TOCL)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Computational Logic (TOCL), Volume 5 Issue 1, January 2004

Deterministic generators and games for Ltl fragments
Rajeev Alur, Salvatore La Torre
Pages: 1-25
DOI: 10.1145/963927.963928
Deciding infinite two-player games on finite graphs with the winning condition specified by a linear temporal logic (Ltl) formula, is known to be 2Exptime-complete. In this paper, we identify Ltl fragments of lower complexity. Solving Ltl games...

Precongruence formats for decorated trace semantics
Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
Pages: 26-78
DOI: 10.1145/963927.963929
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labeled transition systems, and formats of transition system specifications using Plotkin's structural approach....

A modal logic for mobile agents
Rocco De Nicola, Michele Loreti
Pages: 79-128
DOI: 10.1145/963927.963930
Klaim is an experimental programming language that supports a programming paradigm where both processes and data can be moved across different computing environments. The language relies on the use of explicit localities. This paper presents a...

Super logic programs
Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
Pages: 129-176
DOI: 10.1145/963927.963931
The Autoepistemic Logic of Knowledge and Belief (AELB) is a powerful nonmonotonic formalism introduced by Teodor Przymusinski in 1994. In this paper, we specialize it to a class of theories called "super logic programs". We argue that these programs...