Till KTH:s startsida Till KTH:s startsida

Nyhetsflöde

Logga in till din kurswebb

Du är inte inloggad på KTH så innehållet är inte anpassat efter dina val.

I Nyhetsflödet hittar du uppdateringar på sidor, schema och inlägg från lärare (när de även behöver nå tidigare registrerade studenter).

Augusti 2018
Administratör Thomas Sjöland skrev inlägget 29 augusti 2018
 
Oktober 2017

Visa tidigare händelser (1)

Lärare Thomas Sjöland korrigerade 11 oktober 2017

Summary of lecture week 7

Meta programming. The primitives var, nonvar, ground.¶How to  implement apply in Prolog. map_list as an example of "higher order programming" à la functional programming.¶

Meta programming. The primitives var, nonvar, ground.¶

arg and functor to construct and deconstruct terms.¶

How to collect all solutions in a list:
The primitives findall, bagof and setof.

Self interpreters. The Vanilla prolog interpreter.

Expert systems in Prolog.

 
Lärare Thomas Sjöland skrev inlägget 11 oktober 2017
 

Visa tidigare händelser (1)

Lärare Thomas Sjöland korrigerade 2 oktober 2017

Summary of lecture week 5

Negation with the NAF-rule (negation as failure).

We defined the !-primitive (cut) and introduced "if-then-else"-syntax.

Search in graphs, and problem formulation med generate-and-test.

permute to generate all possible permutations of a list.

Some examples: N-queens, missionaries and cannibals,

Finding a path in a graph. Avoiding loops in graph search.

Different search methods for parallellism in Prolog was skipped.

All questions on the material are welcome! Use e-mail or this News feed.

 
September 2017

Visa tidigare händelser (1)

Lärare Thomas Sjöland korrigerade 29 september 2017

Summary of the lecture week 4

Algorithms over trees and lists. A dictionary implementerad with a sorted open-ended binary tree. Rreverse, append, merge to keep lists sortend. Defining flatten on nested lists.

The accumulating parameter technique. append3. Considering the complexity. Using apopend3 to divide a list in three parts. Which is better ((app o app) o app)  or (app o (app o app))  (using o for relation composition)?

Difference lists. Implementing append for difference lists. Complexity. Consider similarities between using difference lists and the accumulating parameter technique.

Generalising an algorithm by defining separate clauses for representations and equality.

"abstract data types", keeping the represenation separated from the algorithm.

 
Lärare Thomas Sjöland skrev inlägget 13 september 2017
 
Lärare Thomas Sjöland skrev inlägget 8 september 2017
 
Lärare Thomas Sjöland skrev inlägget 8 september 2017
 
under Allmänt

Visa tidigare händelser (6)

Lärare kommenterade 2 september 2017

I think you are right, Jimmy. There has to be some timepoint at which the properly holds. It seems to me that otherwise the question become fairly meaningless, something like "is there some timepoint at which either of the two teachers are busy". If you have a total time frame with a start time and a stop time you might look for a time point (or rather a time interval) when neither of the teachers are teaching.