ACM DL

Computational Logic (TOCL)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Computational Logic (TOCL), Volume 4 Issue 2, April 2003

Computational properties of metaquerying problems
Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Giovambattista Ianni, Luigi Palopoli
Pages: 149-180
DOI: 10.1145/635499.635501
Metaquerying is a data mining technology by which hidden dependencies among several database relations can be discovered. This tool has already been successfully applied to several real-world applications, but only preliminary results about the...

Simulation-based minimization
Doron Bustan, Orna Grumberg
Pages: 181-206
DOI: 10.1145/635499.635502
We present a minimization algorithm that receives a Kripke structure M and returns the smallest structure that is simulation equivalent to M. The simulation equivalence relation is weaker than bisimulation but stronger than the...

On proving left termination of constraint logic programs
Fred Mesnard, Salvatore Ruggieri
Pages: 207-259
DOI: 10.1145/635499.635503
The Constraint Logic Programming (CLP) Scheme merges logic programming with constraint solving over predefined domains. In this article, we study proof methods for universal left termination of constraint logic programs. We provide a sound and...

Logics of metric spaces
Oliver Kutz, Frank Wolter, Holger Sturm, Nobu-Yuki Suzuki, Michael Zakharyaschev
Pages: 260-294
DOI: 10.1145/635499.635504
We investigate the expressive power and computational properties of two different types of languages intended for speaking about distances. First, we consider a first-order language FM the two-variable fragment of which turns out to be undecidable in...