Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic (TOCL), Volume 8
Volume 8, Number 1, January 2007
- Alessio Guglielmi
:
A system of interaction and structure. 1 - Paolo Liberatore, Marco Schaerf:
Compilability of propositional abduction. 2 - Annabelle McIver, Carroll Morgan:
Results on the quantitative µ-calculus qMµ. 3 - Alexander Rabinovich:
On compositionality and its limitations. 4 - Greta Yorsh, Thomas W. Reps, Mooly Sagiv, Reinhard Wilhelm:
Logical characterizations of heap abstractions. 5 - Maria Paola Bonacina, Nachum Dershowitz:
Abstract canonical inference. 6 - Joost Vennekens, David Gilis, Marc Denecker:
Erratum to splitting an operator: Algebraic modularity results for logics with fixpoint semantics. 7
Volume 8, Number 2, April 2007
- Karl Crary:
Sound and complete elimination of singleton kinds. 8 - Fangzhen Lin, Jia-Huai You:
Recycling computed answers in rewrite systems for abduction. 9 - Paolo Liberatore:
Where fail-safe default logics fail. 10 - Michael Benedikt, Leonid Libkin, Frank Neven:
Logical definability and query languages over ranked and unranked trees. 11 - Viorica Sofronie-Stokkermans:
On unification for bounded distributive lattices. 12 - John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
The arithmetical complexity of dimension and randomness. 13
Volume 8, Number 3, July 2007
- Marco Pedicini, Francesco Quaglia:
PELCR: Parallel environment for optimal lambda-calculus reduction. 14 - Andreas Blass, Yuri Gurevich:
Ordinary interactive small-step algorithms, II. 15 - Andreas Blass, Yuri Gurevich:
Ordinary interactive small-step algorithms, III. 16 - Thomas Eiter, Michael Fink, Stefan Woltran:
Semantical characterizations and complexity of equivalences in answer set programming. 17 - Ofer Arieli:
Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae. 18
Volume 8, Number 4, August 2007
- Renate A. Schmidt, Ullrich Hustadt:
The axiomatic translation principle for modal logic. 19 - Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont:
Probabilistic abstraction for model checking: An approach based on property testing. 20 - Arnaud Durand, Etienne Grandjean:
First-order queries on structures of bounded degree are computable with constant delay. 21 - Nicola Olivetti, Gian Luca Pozzato, Camilla Schwind:
A sequent calculus and a theorem prover for standard conditional logics. 22 - Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey:
Removing propagation redundant constraints in redundant modeling. 23 - Edward Hung, Lise Getoor, V. S. Subrahmanian:
Probabilistic interval XML. 24
a service of 
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 2024-04-22 20:03 CEST 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:
