ACM DL

Computational Logic (TOCL)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Computational Logic (TOCL), Volume 7 Issue 3, July 2006

Logic program-based updates
Yan Zhang
Pages: 421-472
DOI: 10.1145/1149114.1149115
In logic program-based updates, contradictory information elimination, conflict resolution, and syntactic representation are three major issues that interfere with each other and significantly influence the update result. We observe that existing...

Fast verification of MLL proof nets via IMLL
Andrzej S. Murawski, C.-H. Luke Ong
Pages: 473-498
DOI: 10.1145/1149114.1149116
We consider the following decision problems:ProofNet: Is a given multiplicative linear logic (MLL) proof structure a proof net?EssNet: Is a given essential net (of an intuitionistic MLL sequent) correct?In this article we show how to obtain...

The DLV system for knowledge representation and reasoning
Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello
Pages: 499-562
DOI: 10.1145/1149114.1149117
Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows one to express every property of finite structures that is decidable...

Soft concurrent constraint programming
Stefano Bistarelli, Ugo Montanari, Francesca Rossi
Pages: 563-589
DOI: 10.1145/1149114.1149118
Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft constraint solving formalisms, even distributed ones, as yet...

Comprehending software correctness implies comprehending an intelligence-related limitation
Arthur Charlesworth
Pages: 590-612
DOI: 10.1145/1149114.1149119
This article applies mathematical logic to obtain a rigorous foundation for previous inherently nonrigorous results and also extends those previous results. Roughly speaking, our main theorem states: any agent A that comprehends the...