default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic (TOCL), Volume 6
Volume 6, Number 1, January 2005
- Thomas A. Henzinger, Rupak Majumdar, Jean-François Raskin:
A classification of symbolic transition systems. 1-32 - Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari
:
Making abstract domains condensing. 33-60 - Robert Harper, Frank Pfenning:
On equivalence and canonical forms in the LF type theory. 61-101 - Rakesh M. Verma, Ara Hayrapetyan:
A new decidability technique for ground term rewriting systems with applications. 102-123 - Churn-Jung Liau:
A modal logic framework for multi-agent belief fusion. 124-174 - Wim H. Hesselink:
Eternity variables to prove simulation of specifications. 175-201
Volume 6, Number 2, April 2005
- Chiaki Sakama:
Induction from answer sets in nonmonotonic logic programs. 203-231 - Marco Cadoli, Thomas Eiter, Georg Gottlob:
Complexity of propositional nested circumscription and nested abnormality theories. 232-272 - Orna Kupferman, Moshe Y. Vardi:
From linear time to branching time. 273-294 - Kewen Wang, Lizhu Zhou:
Comparisons and computation of well-founded semantics for disjunctive logic programs. 295-327 - Sara Cohen, Yehoshua Sagiv, Werner Nutt:
Equivalences among aggregate queries with negation. 328-360 - Konstantin Korovin, Andrei Voronkov:
Knuth-Bendix constraint solving is NP-complete. 361-388 - Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits:
Reasoning about evolving nonmonotonic knowledge bases. 389-440 - Panos Rondogiannis, William W. Wadge:
Minimum model semantics for logic programs with negation-as-failure. 441-467 - Klaus Aehlig, Jan Johannsen:
An elementary fragment of second-order lambda calculus. 468-480
Volume 6, Number 3, 2005
- Foto N. Afrati, Stavros S. Cosmadakis, Eugénie Foustoucos:
Datalog programs and their persistency numbers. 481-518 - Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
On the complexity of the disjunction property in intuitionistic and modal logics. 519-538 - Matthew Stone:
Disjunction and modular goal-directed proof search. 539-577 - George Metcalfe, Nicola Olivetti, Dov M. Gabbay:
Sequent and hypersequent calculi for abelian and Łukasiewicz logics. 578-613 - Bernard Boigelot, Sébastien Jodogne, Pierre Wolper:
An effective decision procedure for linear arithmetic over the integers and reals. 614-633 - Nicole Schweikardt:
Arithmetic, first-order logic, and counting quantifiers. 634-671
Volume 6, Number 4, October 2005
- Krzysztof R. Apt:
Editorial. 673 - Phokion G. Kolaitis:
LICS 2003 special issue. 674 - Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan:
Automatic linear orders and trees. 675-700 - Andrzej S. Murawski:
About the undecidability of program equivalence in finitary languages with state. 701-726 - James F. Lynch:
Convergence law for random graphs with specified degree sequence. 727-748 - Dale Miller, Alwen Tiu:
A proof theory for generic judgments. 749-783 - Dominic J. D. Hughes, Rob J. van Glabbeek:
Proof nets for unit-free multiplicative-additive linear logic. 784-842
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-20 19:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
