Pages that link to "Item:Q2946565"

The following pages link to ACM Transactions on Computational Logic (Q2946565):

Displaying 50 items.

• Faster statistical model checking for unbounded temporal properties (Q2272915) (← links)
• Monadic Second-Order Logic with Arbitrary Monadic Predicates (Q2922023) (← links)
• Hierarchies in Inclusion Logic with Lax Semantics (Q2937394) (← links)
• The geometry of linear higher-order recursion (Q2946566) (← links)
• Probabilistic bisimulation as a congruence (Q2946567) (← links)
• Termination of rewriting under strategies (Q2946568) (← links)
• A compositional semantics for CHR (Q2946569) (← links)
• Proofs, tests and continuation passing style (Q2946570) (← links)
• PSPACE bounds for rank-1 modal logics (Q2946571) (← links)
• On the proof complexity of deep inference (Q2946572) (← links)
• Checking timed Büchi automata emptiness on simulation graphs (Q2946573) (← links)
• LTL with the freeze quantifier and register automata (Q2946574) (← links)
• Generalizing consistency and other constraint properties to quantified constraints (Q2946575) (← links)
• Analytic tableaux calculi for KLM logics of nonmonotonic reasoning (Q2946576) (← links)
• An algebra of quantum processes (Q2946577) (← links)
• Simultaneous checking of completeness and ground confluence for algebraic specifications (Q2946578) (← links)
• Tableau calculus for preference-based conditional logics (Q2946579) (← links)
• Differential recursion (Q2946580) (← links)
• A new function algebra of EXPTIME functions by safe nested recursion (Q2946581) (← links)
• Context semantics, linear logic, and computational complexity (Q2946582) (← links)
• Extending the loop language with higher-order procedural variables (Q2946583) (← links)
• Sup-interpretations, a semantic method for static analysis of program resources (Q2946584) (← links)
• A flow calculus of <i>mwp</i> -bounds for complexity analysis (Q2946585) (← links)
• Resource control graphs (Q2946586) (← links)
• Finitary winning in ω-regular games (Q2946587) (← links)
• Automated termination proofs for logic programs by term rewriting (Q2946588) (← links)
• Tableau-based decision procedures for logics of strategic ability in multiagent systems (Q2946589) (← links)
• Regular tree languages definable in FO and in FO _<i>mod</i> (Q2946590) (← links)
• The formal system λδ (Q2946591) (← links)
• Higher-order term indexing using substitution trees (Q2946592) (← links)
• A general framework for sound and complete Floyd-Hoare logics (Q2946594) (← links)
• Logical queries over views (Q2946595) (← links)
• Deciding security properties for cryptographic protocols. application to key cycles (Q2946596) (← links)
• Annotated RDF (Q2946598) (← links)
• Weyl's predicative classical mathematics as a logic-enriched type theory (Q2946599) (← links)
• Undecidability and intractability results concerning datalog programs and their persistency numbers (Q2946600) (← links)
• Proof search specifications of bisimulation and modal logics for the π-calculus (Q2946601) (← links)
• FDNC (Q2946602) (← links)
• A fast algorithm and datalog inexpressibility for temporal reasoning (Q2946603) (← links)
• On the completeness of compositional reasoning methods (Q2946604) (← links)
• Deciding strategy properties of contract-signing protocols (Q2946605) (← links)
• Complexity of propositional proofs under a promise (Q2946606) (← links)
• Lower bounds for bounded depth Frege proofs via Pudlák-Buss games (Q2946607) (← links)
• On the distributivity of LTL specifications (Q2946608) (← links)
• CSL 2008 special issue (Q2946609) (← links)
• A tight Karp-Lipton collapse result in bounded arithmetic (Q2946610) (← links)
• Quantitative languages (Q2946611) (← links)
• Nonuniform Boolean constraint satisfaction problems with cardinality constraint (Q2946612) (← links)
• On isomorphisms of intersection types (Q2946613) (← links)
• Pure pointer programs with iteration (Q2946614) (← links)