ACM DL

Computational Logic (TOCL)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Computational Logic (TOCL), Volume 15 Issue 2, April 2014

Preferred First-Order Answer Set Programs
Vernon Asuncion, Yan Zhang, Yi Zhou
Article No.: 11
DOI: 10.1145/2579817

In this article, we consider the issue of how first-order answer set programs can be extended for handling preference reasoning. To this end, we propose a progression-based preference semantics for first-order answer set programs while explicit...

Formalizing Negotiations Using Logic Programming
Tran Cao Son, Enrico Pontelli, Ngoc-Hieu Nguyen, Chiaki Sakama
Article No.: 12
DOI: 10.1145/2526270

The article introduces a logical framework for negotiation among dishonest agents. The framework relies on the use of abductive logic programming as a knowledge representation language for agents to deal with incomplete information and...

Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations
Cindy Eisner, Dana Fisman, John Havlicek
Article No.: 13
DOI: 10.1145/2532440

We present a characterization that shows what it means for a formula to be a weak or strong version of another formula. We show that the weak version of a formula is not the same as Alpern and Schneider's safety component, but can be achieved by...

Symbolic Bisimulation for Quantum Processes
Yuan Feng, Yuxin Deng, Mingsheng Ying
Article No.: 14
DOI: 10.1145/2579818

With the previous notions of bisimulation presented in the literature, to check if two quantum processes are bisimilar, we have to instantiate their free quantum variables with arbitrary quantum states, and verify the bisimilarity of the resulting...

Pebble Weighted Automata and Weighted Logics
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
Article No.: 15
DOI: 10.1145/2579819

We introduce new classes of weighted automata on words. Equipped with pebbles, they go beyond the class of recognizable formal power series: they capture weighted first-order logic enriched with a quantitative version of transitive closure. In...

Partial-Observation Stochastic Games: How to Win when Belief Fails
Krishnendu Chatterjee, Laurent Doyen
Article No.: 16
DOI: 10.1145/2579821

In two-player finite-state stochastic games of partial observation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distribution over the successor states. The...

Parity Games and Propositional Proofs
Arnold Beckmann, Pavel Pudlák, Neil Thapen
Article No.: 17
DOI: 10.1145/2579822

A propositional proof system is weakly automatizable if there is a polynomial time algorithm that separates satisfiable formulas from formulas that have a short refutation in the system, with respect to a given length bound. We show that if...