Logic Languages Flashcards

(15 cards)

1
Q

horn clause

A

a logical disjunction of literals, where at most one of the literals is positive, and all others are negative

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

logic programming

A

describe what you want as an answer and the language will figure it out for you or say ‘no’

a logic program is typically a set of constraints for a search algo

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Japan’s Fifth Generation Computer Systems project

A

tried to use logic languages for general purpose computing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

logic language uses

A
  • solving logic problems
  • formal machine-processable representations of knowledge
  • symbolic AI
  • theorem proving
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

unification

A

a mechanism for matching symbolic expressions by finding a substitution for variables that makes two terms identical

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

prolog

A

express program and data through
* facts
* relations
* inference rules

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

prolog: atom

A

lower case first letter

e.g. fred

a constant

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

prolog: variable

A

upper case first letter

e.g. Fred

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

prolog: structure

A

relation(subject, object)

e.g. married(fred, wilma)

can have multiple elements f(a, b, c, d)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

prolog: fact

A

unconditional relation

e.g. married(fred, wilma)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

prolog: rule

A

conditional relation

e.g. grandparent(A, C) :- parent(A, B), parent(B, C)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

prolog: query

A

ask if a sequence of terms is related

e.g. grandparent(X, Y) asks if X is a grandparent of Y based on defined rules

the result is the conditions required for the query to be true, e.g. values of X and Y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

backtracking

A

if we don’t like a solution we can ask for the next and continue walking the proof tree until there are no more

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

ASP motivation

A
  • automate/encode human expertise
  • verification
  • transparency
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

ASP uses

A
  • combining ASP with ML for robotics
  • natural language processing
  • planning
  • legal reasoning
How well did you know this?
1
Not at all
2
3
4
5
Perfectly