TY - BOOK
AU - Artemov,Sergei
AU - Nerode,Anil
ED - SpringerLink (Online service)
TI - Logical Foundations of Computer Science: International Symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8–11, 2018, Proceedings
T2 - Theoretical Computer Science and General Issues
SN - 9783319720562
AV - QA8.9-QA10.3
U1 - 005.131 23
PY - 2018///
CY - Cham
PB - Springer International Publishing, Imprint: Springer
KW - Computer Science
KW - Computer science
KW - Logic design
KW - Artificial intelligence
KW - Mathematical Logic and Formal Languages
KW - Arithmetic and Logic Structures
KW - Logics and Meanings of Programs
KW - Artificial Intelligence
KW - Programming Languages, Compilers, Interpreters
KW - Programming Techniques
N1 - Constructive mathematics and type theory -- Homotopy type theory -- Logic, automata, and automatic structures -- Computability and randomness -- Logical foundations of programming -- Logical aspects of computational complexity -- Parameterized complexity -- Logic programming and constraints -- Automated deduction and interactive theorem proving -- Logical methods in protocol and program verification -- Logical methods in program specification and extraction -- Domain theory logics -- Logical foundations of database theory -- Equational logic and term rewriting -- Lambda and combinatory calculi -- Categorical logic and topological semantics -- Linear logic -- Epistemic and temporal logics -- Intelligent and multiple-agent system logics -- Logics of proof and justification -- Non-monotonic reasoning -- Logic in game theory and social software -- Logic of hybrid systems -- Distributed system logics -- Mathematical fuzzy logic -- System design logics
N2 - This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2018, held in Deerfield Beach, FL, USA, in January 2018. The 22 revised full papers were carefully reviewed and selected from 22 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; and other logics in computer science
UR - https://doi.org/10.1007/978-3-319-72056-2
ER -