Category:Logic programming

*

• ► Logic programming researchers‎ (10 P)

A

• ► Automated theorem proving‎ (3 C, 34 P)

B

• ► Belief revision‎ (1 C, 20 P)

C

• ► Constraint logic programming‎ (7 P)
• ► Constraint programming‎ (2 C, 61 P)

I

• ► Inductive logic programming‎ (5 P)

L

• ► Logic programming languages‎ (2 C, 41 P)

N

• ► Normal forms (logic)‎ (12 P)

S

• ► Substitution (logic)‎ (3 P)

U

• ► Unification (computer science)‎ (1 C, 7 P)

• Logic programming

*

• Reasoning system

A

• Abductive logic programming
• Advice taker
• Answer set programming
• Autoepistemic logic

B

• Belief revision
• BNR Prolog

C

• Circumscription (logic)
• Clause (logic)
• Closed-world assumption
• CLP(R)
• Coinduction
• Concurrent constraint logic programming
• Concurrent logic programming
• Conflict resolution strategy
• Constraint logic programming
• Cut (logic programming)

D

• Default logic
• Defeasible logic
• Defeasible reasoning
• Definite clause grammar
• Dis-unification (computer science)

E

• Event calculus

F

• Frame problem
• Functional logic programming

G

• Guarded Command Language

H

• Higher-order abstract syntax

I

• Indeterminacy in concurrent computation
• Inductive programming

M

• MiniKanren

N

• Narrowing of algebraic value sets
• Negation as failure

O

• Occurs check
• Open-world assumption

P

• Production system (computer science)

Q

• Qualification problem

R

• Ramification problem

S

• Scientific community metaphor
• Situation calculus
• SLD resolution
• Stable model semantics
• Structural synthesis of programs
• Substitution (logic)

T

• Term indexing

U

• Unification (computer science)

W

• Warren Abstract Machine
• Well-founded semantics

Y

• Yale shooting problem