Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sebastian Voigt

dblp:42/2096 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Knowledge representation and reasoning · 77% Planning, search and constraint satisfaction · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › logic programming
answer set programming
0.112010
A Temporal Proof System for General Game Playing · AAAI 2010
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game playing
general game playing
0.012010
A Temporal Proof System for General Game Playing · AAAI 2010

Methods — techniques the papers use, named apart from their topics

proof theory · 0.1answer set programming · 0.1
YearPublicationVenuePosition
2010 A Temporal Proof System for General Game Playing
abstract
A general game player is a system that understands the rules of unknown games and learns to play these games well without human intervention. A major challenge for research in General Game Playing is to endow a player with the ability to extract and prove game-specific knowledge from the mere game rules. We define a formal language to express temporally extended — yet local — properties of games. We also develop a provably correct proof theory for this language using the paradigm of Answer Set Programming, and we report on experiments with a practical implementation of this proof system in combination with a successful general game player.
Michael Thielscher, Sebastian Voigt
AAAI2