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

Martin Funkquist

dblp:336/4475 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021

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
2 papers
Language models and text generation · 85% Planning, search and constraint satisfaction · 15%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › text generation › scientific text generation
citation generation
0.712023
CiteBench: A Benchmark for Scientific Citation Text Generation · EMNLP 2023
Natural language and speech › Language models and text generation
text generation evaluation
0.712023
CiteBench: A Benchmark for Scientific Citation Text Generation · EMNLP 2023
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
generalized planning
0.212024
Learning to Ground Existentially Quantified Goals · KR 2024
Information retrieval › document retrieval › domain-specific retrieval
scientific document retrieval
0.212023
CiteBench: A Benchmark for Scientific Citation Text Generation · EMNLP 2023

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

benchmark construction · 1.3supervised learning · 0.8graph neural network · 0.8
YearPublicationVenuePosition
2024 Learning to Ground Existentially Quantified Goals
abstract
Goal instructions for autonomous AI agents cannot assume that objects have unique names. Instead, objects in goals must be referred to by providing suitable descriptions. However, this raises problems in both classical planning and generalized planning. The standard approach to handling existentially quantified goals in classical planning involves compiling them into a DNF formula that encodes all possible variable bindings and adding dummy actions to map each DNF term into the new, dummy goal. This preprocessing is exponential in the number of variables. In generalized planning, the problem is different: even if general policies can deal with any initial situation and goal, executing a general policy requires the goal to be grounded to define a value for the policy features. The problem of grounding goals, namely finding the objects to bind the goal variables, is subtle: it is a generalization of classical planning, which is a special case when there are no goal variables to bind, and constraint reasoning, which is a special case when there are no actions. In this work, we address the goal grounding problem with a novel supervised learning approach. A GNN architecture, trained to predict the cost of partially quantified goals over small domain instances is tested on larger instances involving more objects and different quantified goals. The proposed architecture is evaluated experimentally over several planning domains where generalization is tested along several dimensions including the number of goal variables and objects that can bind such variables. The scope of the approach is also discussed in light of the known relationship between GNNs and C₂ logics.
Martin Funkquist, Simon Ståhlberg, Hector Geffner
KR1
2023 CiteBench: A Benchmark for Scientific Citation Text Generation
abstract
Science progresses by building upon the prior body of knowledge documented in scientific publications.The acceleration of research makes it hard to stay up-to-date with the recent developments and to summarize the evergrowing body of prior work.To address this, the task of citation text generation aims to produce accurate textual summaries given a set of papers-to-cite and the citing paper context.Due to otherwise rare explicit anchoring of cited documents in the citing paper, citation text generation provides an excellent opportunity to study how humans aggregate and synthesize textual knowledge from sources.Yet, existing studies are based upon widely diverging task definitions, which makes it hard to study this task systematically.To address this challenge, we propose CITEBENCH: a benchmark for citation text generation that unifies multiple diverse datasets and enables standardized evaluation of citation text generation models across task designs and domains.Using the new benchmark, we investigate the performance of multiple strong baselines, test their transferability between the datasets, and deliver new insights into the task definition and evaluation to guide future research in citation text generation.We make the code for CITEBENCH publicly available at https://github.com/ UKPLab/citebench.
Martin Funkquist, Ilia Kuznetsov, Yufang Hou 0001, Iryna Gurevych
EMNLP1