language:
Find link is a tool written by Edward Betts.searching for Symposium on Logic in Computer Science 84 found (136 total)
alternate case: symposium on Logic in Computer Science
Leonid Libkin
(346 words)
[view diff]
exact match in snippet
view article
find links to article
program chair of ICDT in 2005, PODS in 2007 and ACM-IEEE Symposium on Logic in Computer Science (LICS) in 2021. Libkin, Leonid (2004). Elements of FiniteSet constraint (919 words) [view diff] exact match in snippet view article find links to article
Set Constraints (Extended Abstract)". Seventh Annual IEEE Symposium on Logic in Computer Science. pp. 329–340.{{cite book}}: CS1 maint: multiple names: authorsLinear logic (2,979 words) [view diff] exact match in snippet view article find links to article
Annual IEEE Symposium on Logic in Computer Science, 1992. LICS '92. Proceedings. Seventh Annual IEEE Symposium on Logic in Computer Science, 1992. LICSRow polymorphism (656 words) [view diff] exact match in snippet view article find links to article
concatenation and multiple inheritance". Proceedings. Fourth Annual Symposium on Logic in Computer Science. pp. 92–97. doi:10.1109/LICS.1989.39162. Wand, MitchellGéraud Sénizergues (243 words) [view diff] exact match in snippet view article find links to article
systems with a few rules". Proceedings 11th Annual IEEE Symposium on Logic in Computer Science. New Brunswick, NJ, USA: IEEE Comput. Soc. Press. pp. 523–531Colour refinement algorithm (1,129 words) [view diff] exact match in snippet view article find links to article
Logic of Graph Neural Networks". 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). LICS '21. New York, NY, USA: Association for ComputingZX-calculus (2,751 words) [view diff] exact match in snippet view article find links to article
Quantum Mechanics". Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. New York, New York, USA: ACM Press. pp. 559–568. arXiv:1705Object model (594 words) [view diff] exact match in snippet view article find links to article
specialization" (PDF). [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science. Vol. 1. pp. 3–37. doi:10.1109/LICS.1993.287603. ISBN 0-8186-3140-6Reversed compound agent theorem (224 words) [view diff] exact match in snippet view article find links to article
Algebras for Quantitative Analysis" (PDF). 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05). pp. 239–248. doi:10.1109/LICS.2005.35. ISBN 0-7695-2266-1Two-variable logic (384 words) [view diff] exact match in snippet view article find links to article
Counting is Decidable., Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 1997. Grohe, Martin. "Finite variable logics in descriptiveCounting quantification (280 words) [view diff] exact match in snippet view article find links to article
with Counting is Decidable." In Proceedings of 12th IEEE Symposium on Logic in Computer Science LICS `97, Warschau. 1997. Postscript file OCLC 2824029332-EXPTIME (960 words) [view diff] exact match in snippet view article find links to article
AC-unifiers", [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp. 11–21, doi:10.1109/LICS.1992.185515, ISBN 0-8186-2735-2Robert Harper (computer scientist) (578 words) [view diff] exact match in snippet view article
31 (5): 181–192. doi:10.1145/249069.231414. "ACM/IEEE Symposium on Logic in Computer Science". Archived from the original on 2024-03-13. Retrieved 2024-03-16Partial equivalence relation (1,183 words) [view diff] exact match in snippet view article find links to article
type theory". [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science. pp. 384–391. doi:10.1109/LICS.1988.5135. ISBN 0-8186-0853-6John C. Reynolds (614 words) [view diff] exact match in snippet view article find links to article
Logic for Shared Mutable Data Structures" (PDF). 17th IEEE Symposium on Logic in Computer Science (LICS 2002). pp. 55–74. doi:10.1109/LICS.2002.1029817. FisherAlternating-time temporal logic (520 words) [view diff] exact match in snippet view article find links to article
Alternating-time Temporal Logic". Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society. doi:10.1109/LICS.2003.1210060. ISBN 0-7695-1884-2NEXPTIME (1,066 words) [view diff] exact match in snippet view article find links to article
Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). CSL-LICS '14. New York, NY, USA: Association forNachum Dershowitz (1,040 words) [view diff] exact match in snippet view article find links to article
(Jun 1986). "Orderings for Equational Proofs". Proc. IEEE Symposium on Logic in Computer Science (LICS). Cambridge/MA. pp. 346–357.{{cite book}}: CS1 maint:Theory of pure equality (761 words) [view diff] exact match in snippet view article find links to article
the monadic class". [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science. pp. 75–83. doi:10.1109/LICS.1993.287598.Hybrid automaton (917 words) [view diff] exact match in snippet view article find links to article
Hybrid Automata". Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science (LICS), pages 278-292, 1996. Alur, R. and Dill, D. L. "ASerge Abiteboul (830 words) [view diff] exact match in snippet view article find links to article
generalized quantifiers". Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226). pp. 28–43. doi:10.1109/LICS.1998.705641Geometry of interaction (490 words) [view diff] exact match in snippet view article find links to article
linear logic". Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. Gonthier, G.; Abadi, M. N.; Lévy, J. J. (1992). "The geometryDaniel P. Friedman (533 words) [view diff] exact match in snippet view article find links to article
"Reasoning with Continuations". Proceedings of the IEEE Symposium on Logic in Computer Science. The Little Lisper. MIT Press. 1987. ISBN 0-262-56038-0Dickson's lemma (1,172 words) [view diff] exact match in snippet view article find links to article
primitive-recursive bounds with Dickson's lemma", 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011), IEEE Computer Soc., Los Alamitos, CA, p. 269Lambda-mu calculus (842 words) [view diff] exact match in snippet view article find links to article
"Separation with Streams in the λμ-calculus". 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26–29 June 2005, Chicago, IL, USA, ProceedingsDavid Spivak (739 words) [view diff] exact match in snippet view article find links to article
Society Press. Proceedings of the Thirty fourth Annual IEEE Symposium on Logic in Computer Science (LICS 2019): 1–13. Editorial Board, Compositionality. AccessedIdentity type (406 words) [view diff] exact match in snippet view article find links to article
uniqueness of identity proofs". Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science. pp. 208–212. doi:10.1109/LICS.1994.316071. ISBN 0-8186-6310-3Polymorphism (computer science) (1,862 words) [view diff] exact match in snippet view article
concatenation and multiple inheritance". Proceedings. Fourth Annual Symposium on Logic in Computer Science. pp. 92–97. doi:10.1109/LICS.1989.39162. Lämmel, Ralf; VisserHilbert's second problem (1,500 words) [view diff] exact match in snippet view article find links to article
Mathematics, and Computer Science.". 2006 21st Annual IEEE Symposium on Logic in Computer Science. IEEE. pp. 339–341. doi:10.1109/LICS.2006.47. ISBN 0-7695-2631-4Kim Guldstrand Larsen (1,584 words) [view diff] exact match in snippet view article find links to article
processes". 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE Symposium on Logic in Computer Science (LICS). IEEE Press. doi:10.1109/LICS40289Hybrid system (1,559 words) [view diff] exact match in snippet view article find links to article
A. (1996), "The Theory of Hybrid Automata", 11th Annual Symposium on Logic in Computer Science (LICS), IEEE Computer Society Press, pp. 278–292, archivedCompositional game theory (748 words) [view diff] exact match in snippet view article find links to article
"Compositional Game Theory". Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. LICS '18. New York, NY, US: Association for Computing MachineryRajeev Alur (452 words) [view diff] exact match in snippet view article find links to article
systems verification (with David Dill). The 2010 LICS (IEEE Symposium on Logic in Computer Science) Test-of-Time award for the 1990 paper "Model-checking forProof assistant (1,206 words) [view diff] exact match in snippet view article find links to article
Circle in Homotopy Type Theory". 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science. pp. 223–232. arXiv:1301.3443. doi:10.1109/lics.2013.28Bob Coecke (1,306 words) [view diff] exact match in snippet view article find links to article
quantum protocols, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004, pp. 415–425 Bob Coecke, Ross Duncan: InteractingS2S (mathematics) (4,618 words) [view diff] exact match in snippet view article
Rabin's decidability theorem?. LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science. arXiv:1508.06780. Kołodziejczyk, Leszek (October 19, 2015)Data type (3,407 words) [view diff] exact match in snippet view article find links to article
new way of defining records in type theory". 18th IEEE Symposium on Logic in Computer Science. LICS 2003. IEEE Computer Society. pp. 86–95. CiteSeerX 10Category of measurable spaces (748 words) [view diff] exact match in snippet view article find links to article
deterministic states". LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. arXiv:2204.07003. doi:10.1145/3531130.3533355.Runtime predictive analysis (1,499 words) [view diff] exact match in snippet view article find links to article
Race Prediction". Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery. pp. 713–727. arXiv:2004Clique-width (2,057 words) [view diff] exact match in snippet view article find links to article
hypergraph orientation", Proceedings of Eighth Annual IEEE Symposium on Logic in Computer Science (LICS '93), pp. 179–190, doi:10.1109/LICS.1993.287589, S2CID 39254668Abstract interpretation (2,924 words) [view diff] exact match in snippet view article find links to article
3-valued propositional formulae". Proceedings 17th Annual IEEE Symposium on Logic in Computer Science. pp. 40–51. doi:10.1109/LICS.2002.1029816. ISBN 0-7695-1483-9Rope-burning puzzle (1,399 words) [view diff] exact match in snippet view article find links to article
Peano arithmetic", Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2021), IEEE, pp. 1–13, arXiv:2003.14342, doi:10.1109/lics52264Knuth–Bendix completion algorithm (2,412 words) [view diff] exact match in snippet view article find links to article
(Jun 1986). "Orderings for Equational Proofs". Proc. IEEE Symposium on Logic in Computer Science. pp. 346–357. N. Dershowitz; J.-P. Jouannaud (1990). JanGame semantics (2,857 words) [view diff] case mismatch in snippet view article find links to article
Program Analysis to Hardware Synthesis. 2009 24th Annual IEEE Symposium on Logic In Computer Science: 17-26. ISBN 978-0-7695-3746-7. G. Japaridze, IntroductionDescriptive complexity theory (2,548 words) [view diff] exact match in snippet view article find links to article
datalog-like languages". [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science. IEEE Comput. Soc. Press. pp. 71–79. doi:10.1109/lics.1989System F (2,531 words) [view diff] exact match in snippet view article find links to article
equivalent and undecidable". Proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science (LICS). pp. 176–185. doi:10.1109/LICS.1994.316068. ISBN 0-8186-6310-3Jordan curve theorem (3,351 words) [view diff] exact match in snippet view article find links to article
Proving the Discrete Jordan Curve Theorem". 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007). IEEE. pp. 245–256. arXiv:1002.2954. doi:10Universal vertex (1,942 words) [view diff] exact match in snippet view article find links to article
to first-order logic properties", 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, IEEE, ppIntersection type (2,394 words) [view diff] exact match in snippet view article find links to article
new way of defining records in type theory". 18th IEEE Symposium on Logic in Computer Science. LICS 2003. IEEE Computer Society. pp. 86–95. CiteSeerX 10Fixed-point logic (2,031 words) [view diff] exact match in snippet view article find links to article
datalog-like languages". [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science. IEEE Comput. Soc. Press. pp. 71–79. doi:10.1109/lics.1989String diagram (3,702 words) [view diff] exact match in snippet view article find links to article
"Compositional Game Theory". Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. pp. 472–481. doi:10.1145/3209108.3209165. ISBN 9781450355834Weighted automaton (1,691 words) [view diff] exact match in snippet view article find links to article
and Cost Register Automata". 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science. pp. 13–22. doi:10.1109/LICS.2013.65. ISBN 978-1-4799-0413-6ELEMENTARY (421 words) [view diff] exact match in snippet view article find links to article
problems of enormous complexity" (PDF), 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, {IEEE} Computer SocietyDe Finetti's theorem (2,571 words) [view diff] exact match in snippet view article find links to article
states". LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. arXiv:2204.07003. doi:10.1145/3531130.3533355. DiaconisCourcelle's theorem (3,146 words) [view diff] exact match in snippet view article find links to article
bounded treewidth", Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2016), pp. 407–416, arXiv:1605.03045, doi:10.1145/2933575History of type theory (2,823 words) [view diff] exact match in snippet view article find links to article
uniqueness of identity proofs". Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science. pp. 208–212. doi:10.1109/LICS.1994.316071. ISBN 0-8186-6310-3Dyadic rational (3,895 words) [view diff] exact match in snippet view article find links to article
Peano arithmetic", Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2021), IEEE, pp. 1–13, arXiv:2003.14342, doi:10.1109/lics52264Constraint satisfaction problem (3,364 words) [view diff] exact match in snippet view article find links to article
Monotone Monadic SNP". Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. LICS '18. New York, NY, USA: Association for ComputingBunched logic (2,832 words) [view diff] exact match in snippet view article find links to article
and Abstract Separation Logic" (PDF). 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007). pp. 366–378. CiteSeerX 10.1.1.66.6337. doi:10Separation logic (3,641 words) [view diff] exact match in snippet view article find links to article
and Abstract Separation Logic" (PDF). 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007). pp. 366–378. CiteSeerX 10.1.1.66.6337. doi:10Simply typed lambda calculus (4,565 words) [view diff] exact match in snippet view article find links to article
lambda -calculus". [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science. pp. 203–211. doi:10.1109/LICS.1991.151645. ISBN 0-8186-2230-XReverse mathematics (4,782 words) [view diff] exact match in snippet view article find links to article
Rabin's decidability theorem?. LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science. arXiv:1508.06780. Kołodziejczyk, Leszek (October 19, 2015)Vadalog (3,029 words) [view diff] exact match in snippet view article find links to article
Languages for New Applications". 2010 25th Annual IEEE Symposium on Logic in Computer Science. pp. 228–242. doi:10.1109/LICS.2010.27. ISBN 978-1-4244-7588-9Regular expression (8,871 words) [view diff] exact match in snippet view article find links to article
of regular events". [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science. pp. 214–225. doi:10.1109/LICS.1991.151646. hdl:1813/6963Homotopy type theory (4,642 words) [view diff] exact match in snippet view article find links to article
uniqueness of identity proofs". Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science. pp. 208–212. doi:10.1109/LICS.1994.316071. ISBN 0-8186-6310-3Frame problem (4,820 words) [view diff] exact match in snippet view article find links to article
mutable data structures". Proceedings 17th Annual IEEE Symposium on Logic in Computer Science. Copenhagen, Denmark: IEEE Comput. Soc. pp. 55–74. CiteSeerX 10Type system (7,205 words) [view diff] exact match in snippet view article find links to article
new way of defining records in type theory". 18th IEEE Symposium on Logic in Computer Science. LICS 2003. IEEE Computer Society. pp. 86–95. CiteSeerX 10Type theory (8,230 words) [view diff] exact match in snippet view article find links to article
"Normalization for Cubical Type Theory". 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Rome, Italy: IEEE. pp. 1–15. arXiv:2101.11479. doi:10Axiom of choice (7,923 words) [view diff] exact match in snippet view article find links to article
Computer Science". Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science (LICS 2006). pp. 339–341. doi:10.1109/LICS.2006.47. ISBN 978-0-7695-2631-7Metric temporal logic (3,231 words) [view diff] exact match in snippet view article find links to article
decidability of metric temporal logic," 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), 2005, pp. 188-197. Ouaknine J., Worrell J. (2006)Matching logic (2,522 words) [view diff] exact match in snippet view article find links to article
"Matching μ-logic". Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS '19. Vancouver, Canada: IEEE Press: 1–13. Chen, Xiaohong;Harry R. Lewis (4,524 words) [view diff] exact match in snippet view article find links to article
time intervals (extended abstract)". Fifth Annual IEEE Symposium on Logic in Computer Science (Philadelphia, PA, 1990). Los Alamitos: IEEE Computer SocietySequent calculus (6,115 words) [view diff] exact match in snippet view article find links to article
"Proving unprovability". Proceedings of the Third Annual Symposium on Logic in Computer Science, July 5–8, 1988. Computer Society Press. pp. 22–26. ISBN 0-8186-0853-6Logic of graphs (5,029 words) [view diff] exact match in snippet view article find links to article
"Capturing polynomial time on interval graphs", 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010), Los Alamitos, California: IEEE Computer SocietyGiry monad (2,002 words) [view diff] exact match in snippet view article find links to article
states". LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. arXiv:2204.07003. doi:10.1145/3531130.3533355. Riehl, EmilyMonad (functional programming) (9,297 words) [view diff] case mismatch in snippet view article
Computational lambda-calculus and monads (PDF). Fourth Annual Symposium on Logic in computer science. Pacific Grove, California. CiteSeerX 10.1.1.26.2787. PeytonLambda calculus (12,168 words) [view diff] exact match in snippet view article find links to article
Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). pp. 1–10. arXiv:1601.01233. doi:10.1145/2603088Twin-width (4,129 words) [view diff] exact match in snippet view article find links to article
Christel; Fisman, Dana (eds.), LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2–5, 2022, Association for ComputingUniqueness of identity proofs (750 words) [view diff] exact match in snippet view article find links to article
uniqueness of identity proofs". Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science. pp. 208–212. doi:10.1109/LICS.1994.316071. ISBN 0-8186-6310-3Quantum contextuality (5,857 words) [view diff] exact match in snippet view article find links to article
comonad in Finite Model Theory". 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). pp. 1–12. arXiv:1704.05124. doi:10.1109/LICS.2017Sara Jane Cox-Conklin (2,351 words) [view diff] exact match in snippet view article find links to article
Infinite Words in Weak MSO". 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE. pp. 448–457. doi:10.1109/lics.2013.51. ISBN 978-1-4799-0413-6Constant-recursive sequence (5,035 words) [view diff] exact match in snippet view article find links to article
Skolem Conjecture". Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS '22. New York, NY, USA: Association for Computing2-satisfiability (9,112 words) [view diff] exact match in snippet view article find links to article
(2004), "A Second-Order Theory for NL", 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04), pp. 398–407, doi:10.1109/LICS.2004.1319634,Hindley–Milner type system (8,534 words) [view diff] exact match in snippet view article find links to article
equivalent and undecidable". Proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science (LICS). pp. 176–185. doi:10.1109/LICS.1994.316068. ISBN 0-8186-6310-3