default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic (TOCL), Volume 7
Volume 7, Number 1, January 2006
- Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, Jia-Huai You:
Unfolding partiality and disjunctions in stable model semantics. 1-37 - Deborah East, Miroslaw Truszczynski:
Predicate-calculus-based logics for modeling and solving search problems. 38-83 - Paolo Liberatore:
Complexity results on DPLL and resolution. 84-107 - Anatoli Degtyarev, Michael Fisher, Boris Konev
:
Monodic temporal resolution. 108-150 - Jürgen Dix, Sarit Kraus, V. S. Subrahmanian:
Heterogeneous temporal probabilistic agents. 151-198
Volume 7, Number 2, April 2006
- Russell Impagliazzo, Nathan Segerlind:
Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations. 199-218 - Paolo Coppola, Simone Martini:
Optimizing optimal reduction: A type inference algorithm for elementary affine logic. 219-260 - Vladimir Lifschitz, Alexander A. Razborov:
Why are there so many loop formulas? 261-268 - Agostino Dovier, Andrea Formisano, Eugenio G. Omodeo:
Decidability results for sets with atoms. 269-301 - Giorgi Japaridze:
Propositional computability logic I. 302-330 - Giorgi Japaridze:
Propositional computability logic II. 331-362 - Andreas Blass, Yuri Gurevich:
Ordinary interactive small-step algorithms, I. 363-419
Volume 7, Number 3, July 2006
- Yan Zhang:
Logic program-based updates. 421-472 - Andrzej S. Murawski, C.-H. Luke Ong:
Fast verification of MLL proof nets via IMLL. 473-498 - Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello:
The DLV system for knowledge representation and reasoning. 499-562 - Stefano Bistarelli, Ugo Montanari, Francesca Rossi:
Soft concurrent constraint programming. 563-589 - Arthur Charlesworth:
Comprehending software correctness implies comprehending an intelligence-related limitation. 590-612
Volume 7, Number 4, October 2006
- Tran Cao Son, Chitta Baral, Tran Hoai Nam, Sheila A. McIlraith:
Domain-dependent knowledge in answer set planning. 613-657 - Lawrence C. Paulson:
Defining functions on equivalence classes. 658-675 - Christopher A. Stone, Robert Harper:
Extensional equivalence and singleton types. 676-722 - Stefan Ratschan:
Efficient solving of quantified inequality constraints over the real numbers. 723-748 - Stephen A. Cook, Neil Thapen:
The strength of replacement in weak arithmetic. 749-764 - Joost Vennekens, David Gilis, Marc Denecker:
Splitting an operator: Algebraic modularity results for logics with fixpoint semantics. 765-797 - Jules Desharnais, Bernhard Möller, Georg Struth:
Kleene algebra with domain. 798-833
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 2026-03-15 22:27 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:
