
Sign up to save your podcasts
Or


Adam Smith talks about Answer Set Programming, and how he's used it in game design and other areas.
Visit the show's web page: thesearch.space
Show notes
| Torsten Schaub at Potsdam University
Several of his presentations contain the formula
ASP = DB + LP + KR + SMT^n
ASP: Answer Set Programming
DB: Database
LP: Logic Programming
KR: Knowledge Representation
SMT: SAT Modulo Theories
SAT solver: Boolean Satisfiability
| this refraction game that I had made a puzzle generator for
Described in Adam's dissertation.
| the Potassco tools from University of Potsdam.
potassco.org
| A book called Procedural Content Generation in Games
www.pcgbook.com
| There's this idea due to Kate Compton ... of the 10 000 bowls of oatmeal problem
http://www.galaxykate.com/blog/generator.html
| We modeled a design space of information visualizations, line plots and scatter plots and bar charts
"Formalizing Visualization Design Knowledge as Constraints: Actionable and Extensible Models in Draco"
| a Python library called Clorm .. so that you can define your problem instances with Python objects
github.com/potassco/clorm
| the concept of elaboration tolerance that when someone gives you some clarification about how your domain works, can you incorporate that change by just adding more code to add more choices or more constraints?
John McCarthy's paper on elaboration tolerance
| a paper from Google DeepMind ... describing a system called the Apperception Engine
"Making sense of sensory input", Evans et al
| taught a class called Applied ASP a few years ago
Lecture slides, programming assignments, reading assignments here: canvas.ucsc.edu/courses/1338
| Once you want to write a program that's more than 30 lines long, how do you profile it? How do you test it? How do you deploy it?
Slides from a talk about Adam's test automation framework: Unit Test Automation for ASP with Ansunit
Try ASP from your browser: https://potassco.org/clingo/run/
Visit the show's web page: thesearch.space
Show notes
Graph Fundamentals — Part 1: RDF
Graph Fundamentals — Part 2: Labelled Property Graphs
Graph Fundamentals — Part 3: Graph Schema Languages
Graph Fundamentals Part 4: Linked Data
https://terminusdb.com/
"a bunch of Swedish hackers with a bunch of JSON blobs"
https://neo4j.com/
Full quote:
[...] there have been many more incoherent standards and initiatives that have come out of the W3C’s standards bodies — almost all of which have launched like lead balloons into a world that cares not a jot. Nevertheless, it is important to recognise that, hidden in all the nonsense, there are some exceptionally good ideas — triples, URL identifiers and OWL itself are all tremendously good ideas in essence and nothing else out there comes close. It is a sad testament to the suffocating nature of design by standards committee which has consumed countless hours of many thousands of smart and genuine researchers, that ultimately the entire community ended up getting it’s ass kicked by a bunch of Swedish hackers with a bunch of json blobs — the Neo4j property graph guys have had a greater impact upon the real world than the whole academic edifice of semantic web research.One of the seminal articles:
https://web.archive.org/web/20171010210556/https://pdfs.semanticscholar.org/566c/1c6bd366b4c9e07fc37eb372771690d5ba31.pdf
— May 17, 2001, The Semantic Web - A new form of Web content that is meaningful to computers will unleash a revolution of new possibilities, Tim Berners-Lee, James Hendler and Ora Lassila
The standardization of RDF, the standardization of OWL...there's a number of very well-known and very accomplished description logic people [...] like Peter Patel-Schneider and [Ian] Horrocks in Oxford.
Kevin discusses this misuse of owl:sameAs and owl:equivalentClass in the the fourth of his blog posts linked to above.
I was talking to some of the guys in Semantic Arts, who are very busy and active consultants in the area.The Google Knowledge Graph was introduced in 2012 with the great slogan "things, not strings"
From TerminusDB: A Technical History:
...we adopted a delta encoding approach to updates as is used in source control systems such as git. This provides transaction processing and updates using immutable database data structures, recovering standard database management features while also providing the whole suite of revision control features: branch, merge, squash, rollback, blame, and time-travel...See for example neo4j's blog post RDF Triple Stores vs. Labeled Property Graphs: What’s the Difference?, in the section "Difference #1: RDF Does Not Uniquely Identify Instances of Relationships of the Same Type".
You can do it in SQL these days, but it's sort of a later addition... the WITH syntax, Common Table Expressions they are called... you can actually do recursive queries.I once showed up at a neo4j meetup with some examples of doing graphy queries in PostgreSQL using Common Table Expressions. (The presentation would have been more impressive if I had but some indexes on those tables...) A way better introduction is the excellent page on The WITH Clause in the SQLite documentation.
People beat up on normal-form modeling and SQL way more than they should.A good recent blog post on this topic: Normalization is not a process.
Even when I'm modelling graph stuff, I start off with basicallyVisit the show's web page: thesearch.space
Show notes
The Power of Prolog, Markus' ongoing book project
"It says, 'Find your way from darkness to light,' which is one of the quotes that occurs in The Knight of Cups, which is a recent movie by Terrence Malick."Declarative program development in Prolog with GUPU (paper)
SEND + MORE = MONEY
"People have ... in different languages, explored multi-dispatch, multi-methods, and all kinds of stuff."(is)/2 is not actually a keyword or a special syntax. Markus describes the issues involved very well here:
https://github.com/triska/clpz#an-impure-alternative-low-level-integer-arithmetic
and here:
https://www.metalevel.at/prolog/clpz
"It is abbreviated as CSP: Constraint Satisfaction Problem."
Eugene C Freuder. “In pursuit of the holy grail”. In:Constraints 2.1 (1997), pp. 57–61. (not freely available)
There is an ongoing series of workshops following up on the ideas in the original paper:
https://freuder.wordpress.com/pthg-20-the-fourth-workshop-on-progress-towards-the-holy-grail/
> "rusty-wam, implemented in Rust"
(hence renamed Scryer Prolog, with Markus being an active contributor)
> "There is O-Prolog, which is implemented by Kenichi Sasagawa from Japan."
> "..in the case of Tau Prolog, it's implemented in JavaScript and they can embed Prolog in a web browser"
The Power of Prolog YouTube channel
Visit the show's web page: thesearch.space
Show notes
Chris Martens' academic website
https://www.csc.ncsu.edu/people/crmarten
04:30
"Programming Interactive Worlds with Linear Logic", Chris' Ph.D. thesis
06:10
James Meehan’s, Tale-Spin thesis
"The Metanovel: Writing Stories by Computer"
A great post about the story of Tale-Spin's creation:
https://grandtextauto.soe.ucsc.edu/2006/09/13/the-story-of-meehans-tale-spin/
18:40
The Twelf Project
The dependently typed logif LF
20:50
Linear logic
Jean-Yves Girard
The original paper
(The first sentence begins: "Linear logic is a logic behind logic...")
22:00
"A form of logical implication pronounced A lolly B" ... I wish I had a screen to draw on"
Looks like this: A -o B (a modified arrow from A to B)
25:10
The frame problem
25:20
Temporal logic
Event calculus
26:50
Pandemic board game
https://www.leacock.com/about
44:40
Interactive fiction
https://www.ifarchive.org/
47:30
Behavior trees
56:00
R. Michael Young
57:30
https://twitter.com/chrisamaphone
github.com/chrisamaphone
Show notes (full notes coming up, please check back soon)
Ryan's talk about Clara at Strange Loop (2014)
https://www.youtube.com/watch?v=Z6oVuYmRgkk
https://github.com/quoll/naga
https://github.com/ulfurinn/wongi-engine
https://github.com/jruizgit/rules
Show notes
08:10
John Alan Robinson
https://en.wikipedia.org/wiki/John_Alan_Robinson
Computational Logic: Memories of the Past and Challenges for the Future
http://www.computational-logic.org/iccl/downloads/Robinson-CL2000.pdf
Maarten van Emden has great material about Robinson, including two interviews:
08:55
The Early Years of Logic Programming (Kowalski)
https://www.doc.ic.ac.uk/~rak/papers/the%20early%20years.pdf
12:05
The British Nationality Act as a Logic Program
https://www.doc.ic.ac.uk/~rak/papers/British%20Nationality%20Act.pdf
12:45
Horn clause logic
https://en.wikipedia.org/wiki/Horn_clause
14:32
Dual process theory
https://en.wikipedia.org/wiki/Dual_process_theory
https://en.wikipedia.org/wiki/Thinking,_Fast_and_Slow
16:30
Alternatives to logic representations of knowledge
17:10
Minsky’s frames
https://en.wikipedia.org/wiki/Frame_(artificial_intelligence)
17:30
Non-monotonic logic
https://en.wikipedia.org/wiki/Non-monotonic_logic
18:10
First-order logic
https://en.wikipedia.org/wiki/First-order_logic
20:45
List concatenation (the append/3 predicate)
http://www.learnprolognow.org/lpnpage.php?pagetype=html&pageid=lpn-htmlse24
23:55
Datalog
https://en.wikipedia.org/wiki/Datalog
Answer Set Programming
https://en.wikipedia.org/wiki/Answer_set_programming
25:50
Cordell Green
https://en.wikipedia.org/wiki/Cordell_Green
26:50
"it was Cordell who was interested in knowledge representation"
STANFORD ARTIFICIAL INTELLIGENCE PROJECT, MEMO Al-96
The Application of Theorem Proving to Question-Answering Systems
https://www.kestrel.edu/home/people/green/publications/green-thesis.pdf
Theorem-Proving by Resolution as a Basis for Question-Answering Systems
https://www.kestrel.edu/home/people/green/publications/theorem-proving.pdf
29:50
Planner, Hewitt, Winograd
https://en.wikipedia.org/wiki/Planner_(programming_language)
https://en.wikipedia.org/wiki/Terry_Winograd
35:00
Monads
https://en.wikipedia.org/wiki/Monad_(functional_programming)
40:10
Alain Colmerauer
https://en.wikipedia.org/wiki/Alain_Colmerauer
Un Systeme de Communication Homme-Machine en Francais
http://alain.colmerauer.free.fr/alcol/ArchivesPublications/HommeMachineFr/HoMa.pdf
42:00
Pat Hayes
https://en.wikipedia.org/wiki/Pat_Hayes
https://www.ihmc.us/groups/phayes/
43:15
The Birth of Prolog (Alain Colmerauer and Philippe Roussel)
http://alain.colmerauer.free.fr/alcol/ArchivesPublications/PrologHistory/19november92.pdf
46:00
Computational Logic and Human Thinking: How to be Artificially Intelligent
https://www.doc.ic.ac.uk/~rak/papers/newbook.pdf
49:00
The Pyramid Principle: Logic in Writing and Thinking (Barbara Minto)
https://www.goodreads.com/book/show/1990595.The_Pyramid_Principle
51:00
Unification
https://en.wikipedia.org/wiki/Unification_(computer_science)
52:20
Backtracking
https://en.wikipedia.org/wiki/Backtracking
56:10
Production rules
https://en.wikipedia.org/wiki/Production_system_(computer_science)
57:10
Expert systems
https://en.wikipedia.org/wiki/Expert_systems
01:08:30
The Fifth Generation Computer Systems project
https://en.wikipedia.org/wiki/Fifth_generation_computer
1:09:50
MapReduce
https://en.wikipedia.org/wiki/MapReduce
1:17:00
Event calculus
https://en.wikipedia.org/wiki/Event_calculus
1:18:20
Logic Production Systems
http://lps.doc.ic.ac.uk/
1:19:40
Logical Contracts (company)
http://logicalcontracts.com/
1:29:45
Minsky's attack on the perceptron
https://en.wikipedia.org/wiki/Perceptron
Logic Programming, you say? That might sound like either an oxymoron or a tautology to you, depending on who you are. If you have heard about Logic Programming before, you are probably thinking about Prolog - a programming language that is almost 50 years old, and which many find fascinating but also frustratingly limited.
What is logic? Many people consider it synonymous with dry intellect, humorless bureaucracy, the opposite of creativity. But in my understanding, logic is an attempt to capture the essence of thought, which is to say the essence of what we humans find reasonable, persuasive, and possible. The study of logic goes straight to some of our fundamental intuitions about the world and ourselves, and it's really not clear at all what they are rooted in. People have lots of different opinions about this. Logic looks very clear-cut on the surface, but when you dig you bump into some of the deepest perennial questions in philosophy. And this doesn't change when we arrive at modern, formalized logic, which sort of looks like mathematics - you are still dealing with deep questions about human psychology and cognition, and how we perceive the physical world.
Now, it turns out formal logic can be used as a programming language. If you are careful about which parts of logic you use, and in which form you write things down, formal logic fits very well with how programming languages are executed. So you can write down some logical formulas, and you get two interpretations: the logical interpretation, and the procedural interpretation which is how you run it on a computer. And these two are, let's say, in sync - you get the deductions you would expect from both interpretations.
As a programming paradigm, this has some really unusual and fun features, and since logic in the first place is, again, an attempt to capture the essence of human though, Logic Programming is in many respects very intuitive. To me, it's the closest to what I imagined programming would be like when I was 10 and had just started to understand that there was a way to tell computers what to do.
From the publisher's feed