ACM DL

Computational Logic (TOCL)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Computational Logic (TOCL), Volume 3 Issue 2, April 2002

Description logics of minimal knowledge and negation as failure
Francesco M. Donini, Daniele Nardi, Riccardo Rosati
Pages: 177-225
DOI: 10.1145/505372.505373
We present description logics of minimal knowledge and negation as failure (MKNF-DLs), which augment description logics with modal operators interpreted according to Lifschitz's nonmonotonic logic MKNF. We show the usefulness of MKNF-DLs for a formal...

Sequent calculi for propositional nonmonotonic logics
Piero Andrea Bonatti, Nicola Olivetti
Pages: 226-278
DOI: 10.1145/505372.505374
A uniform proof-theoretic reconstruction of the major nonmonotonic logics is introduced. It consists of analytic sequent calculi where the details of nonmonotonic assumption making are modelled by an axiomatic rejection method. Another distinctive...

Abstract computability and algebraic specification
J. V. Tucker, J. I. Zucker
Pages: 279-333
DOI: 10.1145/505372.505375
Abstract computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract...