default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic (TOCL), Volume 12
Volume 12, Number 1, October 2010
- Rohit Chadha, Mahesh Viswanathan:
A counterexample-guided abstraction-refinement framework for markov decision processes. 1:1-1:49 - Axel Legay, Pierre Wolper
:
On (Omega-)regular model checking. 2:1-2:46 - Georg Gottlob, Reinhard Pichler, Fang Wei:
Monadic datalog over finite structures of bounded treewidth. 3:1-3:48 - Nicola Galesi, Massimo Lauria:
Optimality of size-degree tradeoffs for polynomial calculus. 4:1-4:22 - Stefano Bistarelli, Ugo Montanari, Francesca Rossi, Francesco Santini:
Unicast and multicast QoS routing with soft-constraint logic programming. 5:1-5:48 - David Billington, Grigoris Antoniou, Guido Governatori, Michael J. Maher:
An inclusion theorem for defeasible logics. 6:1-6:27 - Alessandro Cimatti, Alberto Griggio, Roberto Sebastiani:
Efficient generation of craig interpolants in satisfiability modulo theories. 7:1-7:54 - Carlo A. Furia, Matteo Rossi:
A theory of sampling for continuous-time metric temporal logic. 8:1-8:40
Volume 12, Number 2, January 2011
- Yuri Gurevich, Itay Neeman:
Logic of infons: The propositional case. 9:1-9:28 - Ranko Lazic:
Safety alternating automata on data words. 10:1-10:24 - Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer:
Well-founded semantics for description logic programs in the semantic web. 11:1-11:41 - Stefan Szeider:
Monadic second order logic on graphs with local cardinality constraints. 12:1-12:21 - Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The tractability of model checking for LTL: The good, the bad, and the ugly fragments. 13:1-13:28 - Paulo Shakarian, Austin Parker, Gerardo I. Simari, V. S. Subrahmanian:
Annotated probabilistic temporal logic. 14:1-14:44 - Christian Urban, James Cheney, Stefan Berghofer:
Mechanizing the metatheory of LF. 15:1-15:42 - Andreas Blass, Yuri Gurevich:
Persistent queries in the behavioral theory of algorithms. 16:1-16:43 - Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Damásio:
MWeb: A principled framework for modular web rule bases and its semantics. 17:1-17:46
Volume 12, Number 3, May 2011
- Flemming Nielson, Sebastian Nanz, Hanne Riis Nielson:
Modal abstractions of concurrent behavior. 18:1-18:40 - Marcin Jurdzinski, Ranko Lazic:
Alternating automata on data trees and XPath satisfiability. 19:1-19:21 - Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits:
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination. 20:1-20:39 - Jan A. Bergstra, Alban Ponse:
Proposition algebra. 21:1-21:36 - José Espírito Santo, Luís Pinto:
A calculus of multiary sequent terms. 22:1-22:41
Volume 12, Number 4, July 2011
- Lutz Straßburger, Alessio Guglielmi:
A system of interaction and structure IV: The exponentials and decomposition. 23:1-23:39 - Andrei A. Bulatov:
Complexity of conservative constraint satisfaction problems. 24:1-24:66 - Paolo Ferraris:
Logic programs with propositional connectives and aggregates. 25:1-25:40 - Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß:
Unification and matching on compressed terms. 26:1-26:37 - Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Two-variable logic on data words. 27:1-27:26 - Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger:
Qualitative concurrent parity games. 28:1-28:51 - Md. Aquil Khan, Mohua Banerjee:
Logics for information systems and their dynamic extensions. 29:1-29:36
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-09 22:06 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:
