by

Wikipedia Bot (@wikibot, 0)

Logic in computer science

Table of contents

Automated theorem proving

 1  0 

Linear logic

 0  0 

Logic conferences

 0  0 

Logic families

 0  0 

Logic gates

 0  0 

Logic programming

 0  0 

Logical calculi

 0  0 

Program logic

 0  0 

Programming language semantics

 0  0 

Quantum gates

 0  0 

Type theory

 0  0 

ACM Transactions on Computational Logic

 0  0 

Alternating-time temporal logic

 0  0 

Anti-unification (computer science)

 0  0 

Assertion (software development)

 1  0 

Backward chaining

 0  0 

Boolean circuit

 0  0 

Boolean flag

 0  0 

Boolean satisfiability problem

 0  0 

Bunched logic

 0  0 

CTL*

 0  0 

Combinational logic

 0  0 

Combs method

 0  0 

CompCert

 0  0 

Computability logic

 0  0 

Computation tree logic

 0  0 

Computational logic

 0  0 

Curry–Howard correspondence

 0  0 

DatalogZ

 0  0 

DiVincenzo's criteria

 0  0 

Event calculus

 0  0 

Fluent (artificial intelligence)

 0  0 

Frege system

 0  0 

Functional completeness

 0  0 

Functional verification

 0  0 

Fuzzy logic

 0  0 

Game semantics

 0  0 

Geometry of interaction

 0  0 

HOL (proof assistant)

 0  0 

Hennessy–Milner logic

 0  0 

Herbrand Award

 0  0 

Horn-satisfiability

 0  0 

Horn clause

 0  0 

Interference freedom

 0  0 

Intuitionistic logic

 0  0 

Intuitionistic type theory

 0  0 

Journal of Automated Reasoning

 0  0 

Journal of Logic and Computation

 0  0 

Karnaugh map

 0  0 

Knowledge Interchange Format

 0  0 

Logic for Computable Functions

 0  0 

Logic optimization

 0  0 

Logical Methods in Computer Science

 0  0 

Logical framework

 0  0 

Maximum satisfiability problem

 0  0 

Model checking

 0  0 

Model elimination

 0  0 

Multi-Agent Programming Contest

 0  0 

Noise-based logic

 0  0 

Ordered weighted averaging aggregation operator

 0  0 

Peano axioms

 0  0 

Perceptual computing

 0  0 

Postcondition

 0  0 

Precondition

 0  0 

Preferential entailment

 0  0 

Proof complexity

 0  0 

Propositional proof system

 0  0 

Q0 (mathematical logic)

 0  0 

Race condition

 0  0 

Racetrack problem

 0  0 

Runtime verification

 0  0 

SAT solver

 0  0 

Satisfiability modulo theories

 0  0 

Separation logic

 0  0 

Sequential logic

 0  0 

State space enumeration

 0  0 

Structural induction

 0  0 

Successor function

 0  0 

Symposium on Logic in Computer Science

 0  0 

Tseytin transformation

 0  0 

Twelf

 0  0 

Type-1 OWA operators

 0  0 

Type-2 fuzzy sets and systems

 0  0 

Typed lambda calculus

 0  0 

Undecidable problem

 1  0 

Unification (computer science)

 0  0 

WalkSAT

 0  0 

ΛProlog

 0  0 

 Ancestors (5)

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic + Create my own version