| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Kousha Etessami, Mihalis Yannakakis |
Model Checking of Recursive Probabilistic Systems.  |
ACM Trans. Comput. Log.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | David Baelde |
Least and Greatest Fixed Points in Linear Logic. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Phuong Nguyen, Stephen A. Cook |
The Complexity of Proving the Discrete Jordan Curve Theorem. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefano Berardi, Ugo de'Liguoro |
Interactive Realizers: A New Approach to Program Extraction from Nonconstructive Proofs. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca |
An Implicit Characterization of PSPACE. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paulo Shakarian, Gerardo I. Simari, V. S. Subrahmanian |
Annotated Probabilistic Temporal Logic: Approximate Fixpoint Implementation. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Danicic, Robert M. Hierons, Michael R. Laurence |
Complexity of Data Dependence Problems for Program Schemas with Concurrency. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mauro Ferrari, Camillo Fiorentini, Guido Fiorino |
Simplification Rules for Intuitionistic Propositional Tableaux. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas |
The Complexity of Reasoning for Fragments of Autoepistemic Logic. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Gurfinkel, Marsha Chechik |
Robust Vacuity for Branching Temporal Logic. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent R. Madelaine, Barnaby Martin |
The Complexity of Positive First-Order Logic without Equality. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeroen Keiren, Michel A. Reniers, Tim A. C. Willemse |
Structural Analysis of Boolean Equation Systems. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Naghmeh Ghafari, Arie Gurfinkel, Nils Klarlund, Richard J. Trefler |
Reachability Problems in Piecewise FIFO Systems. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jordi Levy, Mateu Villaret |
Nominal Unification from a Higher-Order Perspective. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Cinzia Di Giusto, Maurizio Gabbrielli, Maria Chiara Meo |
On the Expressive Power of Multiple Heads in CHR. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wouter Gelade, Frank Neven |
Succinctness of the Complement and Intersection of Regular Expressions. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benno van den Berg, Richard Garner |
Topological and Simplicial Models of Identity Types. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakob Nordström |
On the Relative Strength of Pebbling and Resolution. |
ACM Trans. Comput. Log. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger |
Qualitative concurrent parity games. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Persistent queries in the behavioral theory of algorithms. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan A. Bergstra, Alban Ponse |
Proposition algebra. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits |
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Szeider |
Monadic second order logic on graphs with local cardinality constraints. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin |
Two-variable logic on data words. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer |
Well-founded semantics for description logic programs in the semantic web. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bauland, Martin Mundhenk, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
The tractability of model checking for LTL: The good, the bad, and the ugly fragments. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lutz Straßburger, Alessio Guglielmi |
A system of interaction and structure IV: The exponentials and decomposition. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov |
Complexity of conservative constraint satisfaction problems. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Urban, James Cheney, Stefan Berghofer |
Mechanizing the metatheory of LF. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Damásio |
MWeb: A principled framework for modular web rule bases and its semantics. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Md. Aquil Khan, Mohua Banerjee |
Logics for information systems and their dynamic extensions. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ferraris |
Logic programs with propositional connectives and aggregates. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Jurdzinski, Ranko Lazic |
Alternating automata on data trees and XPath satisfiability. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | José Espírito Santo, Luis Pinto |
A calculus of multiary sequent terms. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paulo Shakarian, Austin Parker, Gerardo I. Simari, V. S. Subrahmanian |
Annotated probabilistic temporal logic. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Adria Gascón, Guillem Godoy, Manfred Schmidt-Schauß |
Unification and matching on compressed terms. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ranko Lazic |
Safety alternating automata on data words. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuri Gurevich, Itay Neeman |
Logic of infons: The propositional case. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Flemming Nielson, Sebastian Nanz, Hanne Riis Nielson |
Modal abstractions of concurrent behavior. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Hofmann, Ulrich Schöpp |
Pure pointer programs with iteration. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg Gottlob, Reinhard Pichler, Fang Wei |
Monadic datalog over finite structures of bounded treewidth. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Sebastian Müller |
A tight Karp-Lipton collapse result in bounded arithmetic. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stavros S. Cosmadakis, Eugénie Foustoucos, Anastasios Sidiropoulos |
Undecidability and intractability results concerning datalog programs and their persistency numbers. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Adams, Zhaohui Luo |
Weyl's predicative classical mathematics as a logic-enriched type theory. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlo A. Furia, Matteo Rossi |
A theory of sampling for continuous-time metric temporal logic. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Prahladh Harsha |
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alwen Tiu, Dale Miller |
Proof search specifications of bisimulation and modal logics for the pi-calculus. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefano Bistarelli, Ugo Montanari, Francesca Rossi, Francesco Santini |
Unicast and multicast QoS routing with soft-constraint logic programming. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Creignou, Henning Schnoor, Ilka Schnoor |
Nonuniform Boolean constraint satisfaction problems with cardinality constraint. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nachum Dershowitz, Iddo Tzameret |
Complexity of propositional proofs under a promise. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Cimatti, Alberto Griggio, Roberto Sebastiani |
Efficient generation of craig interpolants in satisfiability modulo theories. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexis Saurin |
Typing streams in the Lambdaµ-calculus. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | James Bailey, Guozhu Dong, Anthony Widjaja To |
Logical queries over views: Decidability and expressiveness. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Kähler, Ralf Küsters, Thomas Wilke |
Deciding strategy properties of contract-signing protocols. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Jan Kára |
A fast algorithm and datalog inexpressibility for temporal reasoning. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Galesi, Massimo Lauria |
Optimality of size-degree tradeoffs for polynomial calculus. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Billington, Grigoris Antoniou, Guido Governatori, Michael J. Maher |
An inclusion theorem for defeasible logics. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu |
Deciding security properties for cryptographic protocols. application to key cycles. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mariangiola Dezani-Ciancaglini, Roberto Di Cosmo, Elio Giovannetti, Makoto Tatsuta |
On isomorphisms of intersection types. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Axel Legay, Pierre Wolper |
On (Omega-)regular model checking. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marko Samer, Helmut Veith |
On the distributivity of LTL specifications. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hana Chockler, Joseph Y. Halpern, Orna Kupferman |
Erratum for "What causes a system to satisfy a specification?". |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger |
Quantitative languages. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Octavian Udrea, Diego Reforgiato Recupero, V. S. Subrahmanian |
Annotated RDF. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Kaminski, Simone Martini |
CSL 2008 special issue. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Horbach, Christoph Weidenbach |
Superposition for fixed domains. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Chadha, Mahesh Viswanathan |
A counterexample-guided abstraction-refinement framework for markov decision processes. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Eiter, Mantas Simkus |
FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kedar S. Namjoshi, Richard J. Trefler |
On the completeness of compositional reasoning methods. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rob Arthan, Ursula Martin, Erik A. Mathiesen, Paulo Oliva |
A general framework for sound and complete Floyd-Hoare logics. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann |
Automated termination proofs for logic programs by term rewriting. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Yves Marion, Romain Péchoux |
Sup-interpretations, a semantic method for static analysis of program resources. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
static analysis of first-order languages, Resources control |
| 1 | Ruggero Lanotte, Simone Tini |
Probabilistic bisimulation as a congruence. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
probabilistic process algebra, transition rule format, Bisimulation, congruence |
| 1 | Isabelle Gnaedig, Hélène Kirchner |
Termination of rewriting under strategies. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
innermost, local strategy, outermost, Abstraction, termination, induction, narrowing, ordering constraint |
| 1 | Neil Yorke-Smith, Carmen Gervet |
Certainty closure: Reliable constraint reasoning with incomplete or erroneous data. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
Incomplete and erroneous data, reliable solutions, uncertain constraint satisfaction problem, closure |
| 1 | Stéphane Demri, Ranko Lazic |
LTL with the freeze quantifier and register automata. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
Computational complexity, expressiveness |
| 1 | Brigitte Pientka |
Higher-order term indexing using substitution trees. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Akitoshi Kawamura |
Differential recursion. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
differentially algebraic functions, real recursive functions, transcendentally transcendental functions, initial value problems, Analog computation |
| 1 | Mingsheng Ying, Yuan Feng, Runyao Duan, Zheng-Feng Ji |
An algebra of quantum processes. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
super-operator, Quantum computation, process algebra, bisimulation, quantum communication |
| 1 | Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik |
A finite equational base for CCS with left merge and communication merge. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
communication merge, finite equational base, left merge, concurrency, process algebra, CCS, parallel composition, handshaking, Bisimilarity |
| 1 | Luca Iocchi, Thomas Lukasiewicz, Daniele Nardi, Riccardo Rosati |
Reasoning about actions with sensing under qualitative and probabilistic uncertainty. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
qualitative and probabilistic uncertainty, description logics, sensing, Reasoning about actions, imprecise probabilities, action languages |
| 1 | Alessandro Armando, Maria Paola Bonacina, Silvio Ranise, Stephan Schulz |
New results on rewrite-based satisfiability procedures. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
combination of theories, satisfiability modulo a theory, scalability, inference, termination, Automated reasoning, decision procedures, rewriting, superposition |
| 1 | Lutz Schröder, Dirk Pattinson |
PSPACE bounds for rank-1 modal logics. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
Shallow models, resolution, coalgebra |
| 1 | Lou van den Dries, Yiannis N. Moschovakis |
Arithmetic complexity. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
Lower bounds for arithmetical problems, coprimeness, greatest common divisor, recursive programs |
| 1 | Jean-Yves Moyen |
Resource control graphs. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
non-size increasing computation, size change termination, program analysis, Implicit computational complexity, program termination |
| 1 | Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato |
Analytic tableaux calculi for KLM logics of nonmonotonic reasoning. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
Analytic tableaux calculi, nonmonotonic reasoning |
| 1 | Lucas Bordeaux, Marco Cadoli, Toni Mancini |
Generalizing consistency and other constraint properties to quantified constraints. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
quantified constraints, Constraint satisfaction, quantified Boolean formulae |
| 1 | Neil D. Jones, Lars Kristiansen |
A flow calculus of mwp-bounds for complexity analysis. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
automatable complexity analysis of imperative programs, static program anaysis, Implicit computational complexity |
| 1 | Alexander Artikis, Marek J. Sergot, Jeremy V. Pitt |
Specifying norm-governed computational societies. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
agent, policy, norm, executable specification, event calculus, Action language, contract-net |
| 1 | Michael Benedikt, Luc Segoufin |
Regular tree languages definable in FO and in FOmod. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefano Guerrini, Andrea Masini |
Proofs, tests and continuation passing style. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
Minimal logic, call-by-name, intutionistic logic, linear logic, lambda calculus, continuations passing style, call-by-value |
| 1 | Ugo Dal Lago |
The geometry of linear higher-order recursion. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
higher-order recursion, type systems, lambda calculus, implicit computational complexity, Geometry of interaction |
| 1 | Adel Bouhoula |
Simultaneous checking of completeness and ground confluence for algebraic specifications. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
ground confluence, completeness, algebraic specifications, parameterization, term rewriting systems, Automated deduction |
| 1 | Valentin Goranko, Dmitry Shkatov |
Tableau-based decision procedures for logics of strategic ability in multiagent systems. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tristan Crolard, Emmanuel Polonowski, Pierre Valarcher |
Extending the loop language with higher-order procedural variables. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
Gödel System T, Loop language, higher-order procedures, procedural variables |
| 1 | Juha Kontinen |
A logical characterization of the counting hierarchy. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
Counting hierarchy, majority quantifiers, the 0-1 law, quantifier elimination |
| 1 | Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca |
Guest editorial: Special issue on implicit computational complexity. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshiyasu Arai, Naohi Eguchi |
A new function algebra of EXPTIME functions by safe nested recursion. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
EXPTIME, Implicit computational complexity |
| 1 | Maurizio Gabbrielli, Maria Chiara Meo |
A compositional semantics for CHR. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
Semantics |
| 1 | Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Camilla Schwind |
Tableau calculus for preference-based conditional logics: PCL and its extensions. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
Tableaux calculi, conditional logics |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")