Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Symposium on Logic in Computer Science (view)

searching for Logic in computer science 147 found (319 total)

alternate case: logic in computer science

Degree of truth (402 words) [view diff] no match in snippet view article find links to article

In mathematics, this idea can be developed in terms of fuzzy logic. In computer science, it has found application in artificial intelligence. In philosophy

Linear logic (2,979 words) [view diff] exact match in snippet view article find links to article

notion of analytic proof) lies behind the applications of linear logic in computer science, since it allows the logic to be used in proof search and as a

Jean-Pierre Jouannaud (615 words) [view diff] case mismatch in snippet view article find links to article

Techniques and Applications (RTA) 1989–1994, IEEE Symposium on Logic in Computer Science (LICS) 1993–1997, Conference for Computer Science Logic (CSL)

Dov Gabbay (718 words) [view diff] case mismatch in snippet view article find links to article

of Philosophical Logic (with Franz Guenthner), the Handbook of Logic in Computer Science] (with Samson Abramsky and T. S. E. Maibaum), and the Handbook

John Newsome Crossley (547 words) [view diff] exact match in snippet view article find links to article

British-Australian mathematician and logician who writes in the field of logic in computer science, history of mathematics and medieval history. He is involved in

John Newsome Crossley (547 words) [view diff] exact match in snippet view article find links to article

British-Australian mathematician and logician who writes in the field of logic in computer science, history of mathematics and medieval history. He is involved in

EACSL (154 words) [view diff] case mismatch in snippet view article find links to article

Ackermann Award, the EACSL Outstanding Dissertation Award for Logic in Computer Science. The annual general meeting of members takes place each year during

Helmut Schwichtenberg (374 words) [view diff] exact match in snippet view article find links to article

theory of computability, lambda calculus and applications of logic in computer science. He is a member of the Bavarian Academy of Sciences. Helmut Schwichtenberg

Ashok K. Chandra (411 words) [view diff] case mismatch in snippet view article find links to article

J. Lipton). He was a founder of the annual IEEE Symposium on Logic in Computer Science and served as conference chair of the first three conferences

Guillermo Simari (190 words) [view diff] case mismatch in snippet view article find links to article

since 1990. Since December 2018, he is Professor Emeritus of Logic in Computer Science and Artificial Intelligence at National University of the South

Michael Fourman (632 words) [view diff] exact match in snippet view article find links to article

Informatics from 2001 to 2009. Fourman is worked in applications of logic in computer science, artificial intelligence, and cognitive science – more specifically

Yuri Gurevich (836 words) [view diff] case mismatch in snippet view article find links to article

and privacy. Since 1988, Gurevich has managed the column on Logic in Computer Science in the Bulletin of the European Association for Theoretical Computer

Kleene Award (126 words) [view diff] case mismatch in snippet view article find links to article

The Kleene Award is awarded at the annual IEEE Symposium on Logic in Computer Science (LICS) to the author(s) of the best student paper(s). A paper qualifies

System U (733 words) [view diff] case mismatch in snippet view article find links to article

of Logic in Computer Science. Oxford Science Publications. pp. 117–309. Coquand, Thierry (1986). "An analysis of Girard's paradox". Logic in Computer Science

Robert Harper (computer scientist) (578 words) [view diff] case mismatch in snippet view article

(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-16

Pointer machine (1,556 words) [view diff] case mismatch in snippet view article find links to article

(1988), On Kolmogorov Machines and Related Issues, the column on "Logic in Computer Science", Bulletin of European Association for Theoretical Computer Science

Set constraint (919 words) [view diff] case mismatch in snippet view article find links to article

Constraints (Extended Abstract)". Seventh Annual IEEE Symposium on Logic in Computer Science. pp. 329–340.{{cite book}}: CS1 maint: multiple names: authors

Nachum Dershowitz (1,040 words) [view diff] case mismatch in snippet view article find links to article

1986). "Orderings for Equational Proofs". Proc. IEEE Symposium on Logic in Computer Science (LICS). Cambridge/MA. pp. 346–357.{{cite book}}: CS1 maint: location

Samson Abramsky (1,187 words) [view diff] case mismatch in snippet view article find links to article

information. Samson Abramsky co-edited 6 Volumes Handbook of Logic in Computer Science with Dov Gabbay and Tom Maibaum: 1992. Volume 1: Background: Mathematical

Chu space (1,246 words) [view diff] case mismatch in snippet view article find links to article

"Games semantics for linear logic". Proc. 6th Annual IEEE Symp. On Logic in Computer Science, Amsterdam, July 1991. Los Alamitos: IEEE Computer Society Press:

David L. Dill (1,230 words) [view diff] case mismatch in snippet view article find links to article

verification. In 2010, he received two test of time awards from the Logic in Computer Science conference (for papers published in LICS in 1990). In 2013, he

Row polymorphism (656 words) [view diff] case mismatch in snippet view article find links to article

multiple inheritance". Proceedings. Fourth Annual Symposium on Logic in Computer Science. pp. 92–97. doi:10.1109/LICS.1989.39162. Wand, Mitchell (1991)

Géraud Sénizergues (243 words) [view diff] case mismatch in snippet view article find links to article

with a few rules". Proceedings 11th Annual IEEE Symposium on Logic in Computer Science. New Brunswick, NJ, USA: IEEE Comput. Soc. Press. pp. 523–531

Tautology (rule of inference) (335 words) [view diff] case mismatch in snippet view article

Introduction to Logic 4th edition. Wadsworth Publishing. pp. 364–5. ISBN 9780534145156. Copi and Cohen Moore and Parker Logic in Computer Science, p. 13

2-EXPTIME (960 words) [view diff] case mismatch 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-2,

Tobias Nipkow (527 words) [view diff] case mismatch in snippet view article find links to article

(1991). "Higher-Order Critical Pairs". Proc. 6th IEEE Symposium on Logic in Computer Science. pp. 342–349. Nipkow, T. (1995). "Higher-Order Rewrite Systems

Partial equivalence relation (1,164 words) [view diff] case mismatch in snippet view article find links to article

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-6.

Object model (602 words) [view diff] case mismatch 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-6

John C. Reynolds (614 words) [view diff] case mismatch in snippet view article find links to article

Shared Mutable Data Structures" (PDF). 17th IEEE Symposium on Logic in Computer Science (LICS 2002). pp. 55–74. doi:10.1109/LICS.2002.1029817. Fisher

ZX-calculus (2,748 words) [view diff] case mismatch in snippet view article find links to article

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:1705.11151

Reversed compound agent theorem (224 words) [view diff] case mismatch in snippet view article find links to article

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-1

Two-variable logic (384 words) [view diff] case mismatch in snippet view article find links to article

is Decidable., Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 1997. Grohe, Martin. "Finite variable logics in descriptive complexity

Categorical logic (1,104 words) [view diff] case mismatch in snippet view article find links to article

Gabbay, Dov (2001). Logic and algebraic methods. Handbook of Logic in Computer Science. Vol. 5. Oxford University Press. ISBN 0-19-853781-6. Aluffi,

Counting quantification (280 words) [view diff] case mismatch in snippet view article find links to article

Counting is Decidable." In Proceedings of 12th IEEE Symposium on Logic in Computer Science LICS `97, Warschau. 1997. Postscript file OCLC 282402933 v t e

John V. Tucker (1,569 words) [view diff] case mismatch in snippet view article find links to article

algebras, in S Abramsky, D Gabbay and T Maibaum (eds.), Handbook of Logic in Computer Science, Volume IV: Semantic Modelling, Oxford University Press (1995)

NEXPTIME (1,066 words) [view diff] case mismatch in snippet view article find links to article

Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). CSL-LICS '14. New York, NY, USA: Association for Computing

Scott continuity (753 words) [view diff] case mismatch in snippet view article find links to article

Abramsky, S.; Gabbay, D.M.; Maibaum, T.S.E. (eds.). Handbook of Logic in Computer Science. Vol. III. Oxford University Press. ISBN 978-0-19-853762-5. Bauer

Martin Grohe (547 words) [view diff] exact match in snippet view article find links to article

he was elected as an ACM Fellow in 2017 for "contributions to logic in computer science, database theory, algorithms, and computational complexity". In

David Plaisted (616 words) [view diff] case mismatch in snippet view article find links to article

(1994). "Use of replace rules in theorem proving". Methods of Logic in Computer Science. 1 (2): 217–40. Heng Chu; David A. Plaisted (1994). "Model Finding

Polymorphism (computer science) (1,862 words) [view diff] case mismatch in snippet view article

multiple inheritance". Proceedings. Fourth Annual Symposium on Logic in Computer Science. pp. 92–97. doi:10.1109/LICS.1989.39162. Lämmel, Ralf; Visser

Informatics (2,867 words) [view diff] exact match in snippet view article find links to article

human-computer Interaction information retrieval information theory logic in computer science machine learning mathematical software multiagent systems multimedia

Quantifier elimination (1,435 words) [view diff] case mismatch in snippet view article find links to article

non-recursive types is decidable" (PDF). 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. pp. 96–107. doi:10.1109/LICS.2003.1210049

Ronald Fagin (1,179 words) [view diff] case mismatch in snippet view article find links to article

Edgar F. Codd Innovations Award (2004) Scientific career Fields Logic in Computer Science, Database theory, Finite model theory, Rank and score aggregation

Viggo Stoltenberg-Hansen (197 words) [view diff] case mismatch in snippet view article find links to article

algebras, in S Abramsky, D Gabbay and T Maibaum (eds.), Handbook of Logic in Computer Science, Volume IV: Semantic Modelling, Oxford University Press (1995)

Serge Abiteboul (830 words) [view diff] case mismatch in snippet view article find links to article

quantifiers". Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226). pp. 28–43. doi:10.1109/LICS.1998.705641.

Simply typed lambda calculus (4,588 words) [view diff] case mismatch in snippet view article find links to article

-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-X

Ontology components (1,483 words) [view diff] case mismatch in snippet view article find links to article

Giuseppe De Giacomo; Maurizio Lenzerini (2002). Description Logics: Foundations for Class-based Knowledge Representation. Logic in Computer Science.

Daniel P. Friedman (533 words) [view diff] case mismatch 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-0. The Little

Complete partial order (1,428 words) [view diff] case mismatch in snippet view article find links to article

S2CID 16718857 Abramsky S, Gabbay DM, Maibaum TS (1994). Handbook of Logic in Computer Science, volume 3. Oxford: Clarendon Press. Prop 2.2.14, pp. 20. ISBN 9780198537625

Theory of pure equality (761 words) [view diff] case mismatch in snippet view article find links to article

monadic class". [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science. pp. 75–83. doi:10.1109/LICS.1993.287598. hdl:11858/00-001M-0000-0014-B322-4

Type system (7,205 words) [view diff] case mismatch in snippet view article find links to article

"Martin-Löf's Type Theory". Algebraic and Logical Structures. Handbook of Logic in Computer Science. Vol. 5. Oxford University Press. p. 2. ISBN 978-0-19-154627-3

Moshe Vardi (1,205 words) [view diff] exact match in snippet view article find links to article

"for contributions to the development and use of mathematical logic in computer science". Vardi lives with his wife Pamela Geyer in the Houston area.

François Fages (683 words) [view diff] case mismatch in snippet view article find links to article

Linearity vs Persistence in the Asychronous Pi-Calculus". Proc. Logic in Computer Science - LICS 2006:59-68. "Mixing Math and Expertise". Communications

Hybrid automaton (917 words) [view diff] case mismatch in snippet view article find links to article

Automata". Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science (LICS), pages 278-292, 1996. Alur, R. and Dill, D. L. "A Theory

Hybrid automaton (917 words) [view diff] case mismatch in snippet view article find links to article

Automata". Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science (LICS), pages 278-292, 1996. Alur, R. and Dill, D. L. "A Theory

Higher-order abstract syntax (1,074 words) [view diff] case mismatch in snippet view article find links to article

of higher-order abstract syntax. 14th Annual IEEE Symposium on Logic in Computer Science. p. 204. ISBN 0-7695-0158-3. Eli Barzilay; Stuart Allen (2002)

Lambda-mu calculus (842 words) [view diff] case mismatch 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, Proceedings. IEEE

Data type (3,407 words) [view diff] case mismatch in snippet view article find links to article

way of defining records in type theory". 18th IEEE Symposium on Logic in Computer Science. LICS 2003. IEEE Computer Society. pp. 86–95. CiteSeerX 10.1.1

Partial cyclic order (821 words) [view diff] case mismatch in snippet view article find links to article

Jean-Yves Girard and Paul Ruet and Philip Scott (ed.), Linear Logic in Computer Science, pp. 283–323, retrieved 23 May 2011 Novák, Vítězslav (1984), "On

Hybrid system (1,559 words) [view diff] case mismatch in snippet view article find links to article

(1996), "The Theory of Hybrid Automata", 11th Annual Symposium on Logic in Computer Science (LICS), IEEE Computer Society Press, pp. 278–292, archived from

Alan Turing Year (1,185 words) [view diff] case mismatch in snippet view article find links to article

Templeton Foundation, the Kurt Gödel Society, the IEEE Symposium on Logic in Computer Science, the Science Museum, and Turing100in2012. The Alan Turing Centenary

Hilbert's second problem (1,500 words) [view diff] case mismatch 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-4

Arnon Avron (541 words) [view diff] exact match in snippet view article find links to article

proved the Mohr–Mascheroni theorem. In applying mathematical logic in computer science to artificial intelligence, Avron contributed to the theory of

Dickson's lemma (1,172 words) [view diff] case mismatch 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. 269, arXiv:1007

Proof assistant (1,206 words) [view diff] case mismatch in snippet view article find links to article

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.28. ISBN 978-1-4799-0413-6

XPDL (1,280 words) [view diff] case mismatch in snippet view article find links to article

the XPDL Language Semantics", Symposium on the Effectiveness of Logic in Computer Science, March 2002, PS. F. Puente, A. Rivero, J.D. Sandoval, P. Hernández

Domain theory (2,689 words) [view diff] case mismatch in snippet view article find links to article

Abramsky; D. M. Gabbay; T. S. E. Maibaum (eds.). Handbook of Logic in Computer Science. Vol. III. Oxford University Press. pp. 1–168. ISBN 0-19-853762-X

Programming Computable Functions (883 words) [view diff] case mismatch in snippet view article find links to article

Abramsky, S.; Gabbay, D.; Maibau, T. S. E. (eds.). Handbook of Logic in Computer Science. Oxford University Press. pp. 269–356. Archived from the original

De Bruijn index (1,593 words) [view diff] case mismatch in snippet view article find links to article

Syntax Involving Binders" (PDF). 14th Annual IEEE Symposium on Logic in Computer Science. pp. 214–224. doi:10.1109/LICS.1999.782617. Archived (PDF) from

David Spivak (739 words) [view diff] case mismatch in snippet view article find links to article

Press. Proceedings of the Thirty fourth Annual IEEE Symposium on Logic in Computer Science (LICS 2019): 1–13. Editorial Board, Compositionality. Accessed

Coherent space (1,222 words) [view diff] exact match in snippet view article find links to article

"Between logic and quantic: a tract", in Ehrhard; Girard; Ruet; et al. (eds.), Linear logic in computer science (PDF), Cambridge University Press. v t e

Categorical quantum mechanics (2,203 words) [view diff] case mismatch in snippet view article find links to article

quantum protocols". Proceedings of the 19th IEEE conference on Logic in Computer Science (LiCS'04). IEEE. arXiv:quant-ph/0402130. Selinger, P. (2005).

Linear temporal logic (1,832 words) [view diff] case mismatch in snippet view article find links to article

language Metric temporal logic Safety and liveness properties Logic in Computer Science: Modelling and Reasoning about Systems: page 175 "Linear-time

Dependent type (2,609 words) [view diff] case mismatch in snippet view article find links to article

In Abramsky, S.; Gabbay, D.; Maibaum, T. (eds.). Handbook of Logic in Computer Science. Oxford Science Publications. doi:10.1017/CBO9781139032636. hdl:2066/17231

Class (knowledge representation) (1,075 words) [view diff] case mismatch in snippet view article

Logics: Foundations for Class-based Knowledge Representation. Logic in Computer Science. Note that the names given to the classes mentioned here are entirely

Abstract interpretation (2,924 words) [view diff] case mismatch in snippet view article find links to article

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-9

Binary decision diagram (3,067 words) [view diff] exact match in snippet view article find links to article

IT University of Copenhagen. Huth, Michael; Ryan, Mark (2004). Logic in computer science: modelling and reasoning about systems (2nd ed.). Cambridge University

Colour refinement algorithm (899 words) [view diff] case mismatch in snippet view article find links to article

Graph Neural Networks". 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). LICS '21. New York, NY, USA: Association for Computing

Obliq (654 words) [view diff] case mismatch in snippet view article find links to article

"Efficient Type Inference for Record Concatenation and Subtyping". Logic in Computer Science, Symposium on. Los Alamitos, California, USA: IEEE Computer Society

School of Computer Science and Electronic Engineering, Essex University (615 words) [view diff] exact match in snippet view article find links to article

and computational finance* Ray Turner, notable for his work on logic in computer science and for his pioneering work in the philosophy of computer science

Jordan curve theorem (3,351 words) [view diff] case mismatch in snippet view article find links to article

Discrete Jordan Curve Theorem". 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007). IEEE. pp. 245–256. arXiv:1002.2954. doi:10.1109/lics

Bob Coecke (1,306 words) [view diff] case mismatch 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: Interacting quantum

System F (2,532 words) [view diff] case mismatch in snippet view article find links to article

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

Knuth–Bendix completion algorithm (2,412 words) [view diff] case mismatch in snippet view article find links to article

1986). "Orderings for Equational Proofs". Proc. IEEE Symposium on Logic in Computer Science. pp. 346–357. N. Dershowitz; J.-P. Jouannaud (1990). Jan van Leeuwen

Descriptive complexity theory (2,543 words) [view diff] case mismatch 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.1989.39160

Michael M. Richter (1,242 words) [view diff] case mismatch in snippet view article find links to article

co-initiator and co-chair of an annual series of conferences Logic in Computer Science. In 1989 Michael Richter became head of the research group Mathematical

Leon van der Torre (719 words) [view diff] exact match in snippet view article find links to article

(1997) with Yao-Hua Tan. His thesis was concerned with deontic logic in computer science and its combination with nonmonotonic logic. His main research

Rajeev Alur (452 words) [view diff] case mismatch in snippet view article find links to article

verification (with David Dill). The 2010 LICS (IEEE Symposium on Logic in Computer Science) Test-of-Time award for the 1990 paper "Model-checking for real-time

Defeasible reasoning (2,378 words) [view diff] exact match in snippet view article find links to article

logic of defeasible conditionals, Carlos Alchourron, in Deontic logic in computer science: normative system specification, J. Meyer, R. Wieringa, eds.,

Sequent (2,754 words) [view diff] case mismatch in snippet view article find links to article

Springer-Verlag. ISBN 978-3-642-86897-9. Huth, Michael; Ryan, Mark (2004). Logic in Computer Science (Second ed.). Cambridge, United Kingdom: Cambridge University

Sequent (2,754 words) [view diff] case mismatch in snippet view article find links to article

Springer-Verlag. ISBN 978-3-642-86897-9. Huth, Michael; Ryan, Mark (2004). Logic in Computer Science (Second ed.). Cambridge, United Kingdom: Cambridge University

S2S (mathematics) (4,618 words) [view diff] case mismatch in snippet view article

decidability theorem?. LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science. arXiv:1508.06780. Kołodziejczyk, Leszek (October 19, 2015). "Question

Intersection type (2,394 words) [view diff] case mismatch in snippet view article find links to article

way of defining records in type theory". 18th IEEE Symposium on Logic in Computer Science. LICS 2003. IEEE Computer Society. pp. 86–95. CiteSeerX 10.1.1

Dagger compact category (2,010 words) [view diff] case mismatch in snippet view article find links to article

quantum protocols". Proceedings of the 19th IEEE conference on Logic in Computer Science (LiCS'04). IEEE. pp. 415–425. arXiv:quant-ph/0402130. CiteSeerX 10

Pure type system (1,168 words) [view diff] case mismatch in snippet view article find links to article

In Abramsky, S.; Gabbay, D.; Maibaum, T. (eds.). Handbook of Logic in Computer Science. Oxford Science Publications. Berardi, S. (1990). Type dependence

Clique-width (2,057 words) [view diff] case mismatch in snippet view article find links to article

orientation", Proceedings of Eighth Annual IEEE Symposium on Logic in Computer Science (LICS '93), pp. 179–190, doi:10.1109/LICS.1993.287589, S2CID 39254668

Future of mathematics (1,959 words) [view diff] exact match in snippet view article find links to article

The Twenty-First Century", including set theory, mathematical logic in computer science, and proof theory. In 2000, Lloyd N. Trefethen wrote "Predictions

Regular expression (8,860 words) [view diff] case mismatch in snippet view article find links to article

regular events". [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science. pp. 214–225. doi:10.1109/LICS.1991.151646. hdl:1813/6963.

String diagram (3,699 words) [view diff] case mismatch in snippet view article find links to article

Theory". Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. pp. 472–481. doi:10.1145/3209108.3209165. ISBN 9781450355834

Dyadic rational (3,895 words) [view diff] case mismatch in snippet view article find links to article

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/lics52264

Kim Guldstrand Larsen (1,584 words) [view diff] case mismatch in snippet view article find links to article

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/LICS40289

Path ordering (term rewriting) (774 words) [view diff] case mismatch in snippet view article

Techniques for Term Rewriting Theory". Proc. 3rd IEEE Symp. on Logic in Computer Science (PDF). pp. 104–111. Mitsuhiro Okada, Adam Steele (1988). "Ordering

Mathematics (15,937 words) [view diff] case mismatch in snippet view article find links to article

Moshe; Vianu, Victor (2001). "On the Unusual Effectiveness of Logic in Computer Science" (PDF). Archived (PDF) from the original on March 3, 2021. Retrieved

Loop invariant (2,426 words) [view diff] case mismatch in snippet view article find links to article

Efficient Computation. Science of Computer Programming, 41(2):139–172. October 2001. Michael Huth, Mark Ryan. "Logic in Computer Science.", Second Edition.

De Finetti's theorem (2,571 words) [view diff] case mismatch in snippet view article find links to article

LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. arXiv:2204.07003. doi:10.1145/3531130.3533355. Diaconis, P.;

Hoare logic (3,667 words) [view diff] case mismatch in snippet view article find links to article

S2CID 207726175. Huth, Michael; Ryan, Mark (26 August 2004). Logic in Computer Science: modelling and reasoning about systems (second ed.). Cambridge

Fixed-point logic (2,030 words) [view diff] case mismatch 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.1989.39160

Reverse mathematics (4,782 words) [view diff] case mismatch in snippet view article find links to article

decidability theorem?. LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science. arXiv:1508.06780. Kołodziejczyk, Leszek (October 19, 2015). "Question

Weighted automaton (1,691 words) [view diff] case mismatch in snippet view article find links to article

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-6.

Universal vertex (1,942 words) [view diff] case mismatch in snippet view article find links to article

first-order logic properties", 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, IEEE, pp. 1–13

Rope-burning puzzle (1,399 words) [view diff] case mismatch in snippet view article find links to article

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/lics52264

Compositional game theory (748 words) [view diff] case mismatch in snippet view article find links to article

Theory". Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. LICS '18. New York, NY, US: Association for Computing Machinery

Runtime predictive analysis (1,499 words) [view diff] case mismatch in snippet view article find links to article

Prediction". Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery. pp. 713–727. arXiv:2004

Courcelle's theorem (3,146 words) [view diff] case mismatch in snippet view article find links to article

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/2933575

Semi-Thue system (3,406 words) [view diff] case mismatch in snippet view article find links to article

Abramsky, Dov M. Gabbay, Thomas S. E. Maibaum (ed.), Handbook of Logic in Computer Science: Semantic modelling, Oxford University Press, 1995, ISBN 0-19-853780-8

History of type theory (2,823 words) [view diff] case mismatch in snippet view article find links to article

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-3

Axiom of choice (7,917 words) [view diff] case mismatch 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-7

Currying (5,025 words) [view diff] case mismatch in snippet view article find links to article

March 2007). "A categorical semantics of quantum protocols". Logic in Computer Science (LICS 2004): Proceedings, 19th Annual IEEE Symposium, Turku, Finland

Accountability (8,274 words) [view diff] case mismatch in snippet view article find links to article

of Many Hands". In Governatori, G.; Sartor, G. (eds.). Deontic Logic in Computer Science. Berlin: Springer-Verlag. pp. 274–287. ISBN 978-3-540-70524-6

Category of measurable spaces (748 words) [view diff] case mismatch 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.

Legal informatics (4,083 words) [view diff] case mismatch in snippet view article find links to article

perspective, in: J.-J.Ch. Meyer, R. Wieringa (Eds.), Deontic Logic in Computer Science: Normative System Specification, Wiley, 1993, pp. 275–307 H. Herrestad

Sequent calculus (5,904 words) [view diff] case mismatch in snippet view article find links to article

unprovability", pp.22--26. In Proceedings Of The Third Annual Symposium On Logic In Computer Science, July 5-8, 1988 (1988), IEEE. ISBN 0-8186-0853-6. Buss, Samuel

Lambda calculus (11,994 words) [view diff] case mismatch in snippet view article find links to article

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/2603088.2603105

Frame problem (4,820 words) [view diff] case mismatch 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 10

Homotopy type theory (4,643 words) [view diff] case mismatch in snippet view article find links to article

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-3

Circumscription (logic) (3,464 words) [view diff] case mismatch in snippet view article

Nonmonotonic Reasoning and Uncertain Reasoning. Handbooks of Logic in Computer Science and Artificial Intelligence and Logic Programming. 3. Oxford University

Induction puzzles (6,919 words) [view diff] case mismatch in snippet view article find links to article

S2CID 123369018. Huth, Michael; Ryan, Mark (26 August 2004). Logic in Computer Science: Modelling and Reasoning about Systems. Cambridge: Cambridge University

Generic-case complexity (2,706 words) [view diff] case mismatch in snippet view article find links to article

The challenger-solver game: variations on the theme of P =?NP, Logic in Computer Science Column, The Bulletin of the EATCS, October 1989, p.112-121. R

Propositional calculus (11,441 words) [view diff] case mismatch in snippet view article find links to article

p. 26. ISBN 978-0-201-41640-4. Bachmair, Leo (2009). "CSE541 Logic in Computer Science" (PDF). Stony Brook University. Lawson, Mark V. (2019). A first

Monad (functional programming) (9,312 words) [view diff] exact match in snippet view article

lambda-calculus and monads (PDF). Fourth Annual Symposium on Logic in computer science. Pacific Grove, California. CiteSeerX 10.1.1.26.2787. Peyton Jones

Harry R. Lewis (4,524 words) [view diff] case mismatch in snippet view article find links to article

intervals (extended abstract)". Fifth Annual IEEE Symposium on Logic in Computer Science (Philadelphia, PA, 1990). Los Alamitos: IEEE Computer Society

Vadalog (3,029 words) [view diff] case mismatch 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-9

ELEMENTARY (421 words) [view diff] case mismatch in snippet view article find links to article

of enormous complexity" (PDF), 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, {IEEE} Computer Society, pp. 2–12

Logic of graphs (5,029 words) [view diff] case mismatch in snippet view article find links to article

polynomial time on interval graphs", 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010), Los Alamitos, California: IEEE Computer Society,

Metric temporal logic (3,231 words) [view diff] case mismatch 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)

Quantum contextuality (5,857 words) [view diff] case mismatch in snippet view article find links to article

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.2017.8005129

Matroid parity problem (3,443 words) [view diff] case mismatch in snippet view article find links to article

sets of undirected cubic graphs", Algebra, Combinatorics and Logic in Computer Science, Vol. I, II (Győr, 1983), Colloquia Mathematica Societatis János

Matching logic (2,519 words) [view diff] case mismatch in snippet view article find links to article

μ-logic". Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS '19. Vancouver, Canada: IEEE Press: 1–13. Chen, Xiaohong;

2-satisfiability (9,112 words) [view diff] case mismatch in snippet view article find links to article

"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, ISBN 978-0-7695-2192-3

List of programming language researchers (5,835 words) [view diff] case mismatch in snippet view article find links to article

and concurrency theory and co-editing the 6 Volume Handbook of Logic in Computer Science Jean-Raymond Abrial, father of the Z notation and the B-Method

Constant-recursive sequence (5,040 words) [view diff] case mismatch in snippet view article find links to article

Conjecture". Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS '22. New York, NY, USA: Association for Computing Machinery

Hindley–Milner type system (8,534 words) [view diff] case mismatch in snippet view article find links to article

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

Twin-width (4,077 words) [view diff] case mismatch in snippet view article find links to article

Fisman, Dana (eds.), LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2–5, 2022, Association for Computing Machinery

Algorithm characterizations (8,991 words) [view diff] case mismatch in snippet view article find links to article

Number 81 (October 2003), pages 195–225. Reprinted in Chapter on Logic in Computer Science Current Trends in Theoretical Computer Science World Scientific

Giry monad (2,002 words) [view diff] case mismatch in snippet view article find links to article

LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. arXiv:2204.07003. doi:10.1145/3531130.3533355. Riehl, Emily (2016)

Uniqueness of identity proofs (750 words) [view diff] case mismatch in snippet view article find links to article

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-3

Sara Jane Cox-Conklin (2,411 words) [view diff] case mismatch 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-6