Search
Selected: L

Logics for the Relational Syllogistic

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Logics for Unranked Trees: An Overview

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Loops under Strategies ... Continued

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

LoopW Technical Reference v0.3

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Lower Bound for the Communication Complexity of the Russian Cards Problem

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Lower Bounds for the Complexity of Monadic Second-Order Logic

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Lower Bounds on Syntactic Logic Expressions for Optimization Problems and Duality using Lagrangian Dual to characterize optimality conditions

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

LTL with the Freeze Quantifier and Register Automata

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Ludics with repetitions (Exponentials, Interactive types and Completeness)

Computer Science – Logic in Computer Science
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0
  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.