Logical Methods In Computer Science SCIE

Logical Methods in Computer Science is a fully refereed, open access, free, electronic journal. It welcomes papers on theoretical and practical areas in computer science involving logical methods, taken in a broad sense; some particular areas within its scope are listed below. Papers are refereed in the traditional way, with two or more referees per paper. Copyright is retained by the author.

Topics of Logical Methods in Computer Science:

Algebraic methods

Automata and logic

Automated deduction

Categorical models and logic

Coalgebraic methods

Computability and Logic

Computer-aided verification

Concurrency theory

Constraint programming

Cyber-physical systems

Database theory

Defeasible reasoning

Domain theory

Emerging topics: Computational systems in biology

Emerging topics: Quantum computation and logic

Finite model theory

Formalized mathematics

Functional programming and lambda calculus

Inductive logic and learning

Interactive proof checking

Logic and algorithms

Logic and complexity

Logic and games

Logic and probability

Logic for knowledge representation

Logic programming

Logics of programs

Modal and temporal logics

Program analysis and type checking

Program development and specification

Proof complexity

Real time and hybrid systems

Reasoning about actions and planning

Satisfiability

Security

Semantics of programming languages

Term rewriting and equational logic

Type theory and constructive mathematics.