<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="eisner-2023-time">
    <titleInfo>
        <title>Time-and-Space-Efficient Weighted Deduction</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Jason</namePart>
        <namePart type="family">Eisner</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2023</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <genre authority="bibutilsgt">journal article</genre>
    <relatedItem type="host">
        <titleInfo>
            <title>Transactions of the Association for Computational Linguistics</title>
        </titleInfo>
        <originInfo>
            <issuance>continuing</issuance>
            <publisher>MIT Press</publisher>
            <place>
                <placeTerm type="text">Cambridge, MA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">periodical</genre>
        <genre authority="bibutilsgt">academic journal</genre>
    </relatedItem>
    <abstract>Many NLP algorithms have been described in terms of deduction systems. Unweighted deduction allows a generic forward-chaining execution strategy. For weighted deduction, however, efficient execution should propagate the weight of each item only after it has converged. This means visiting the items in topologically sorted order (as in dynamic programming). Toposorting is fast on a materialized graph; unfortunately, materializing the graph would take extra space. Is there a generic weighted deduction strategy which, for every acyclic deduction system and every input, uses only a constant factor more time and space than generic unweighted deduction? After reviewing past strategies, we answer this question in the affirmative by combining ideas of Goodman (1999) and Kahn (1962). We also give an extension to cyclic deduction systems, based on Tarjan (1972).</abstract>
    <identifier type="citekey">eisner-2023-time</identifier>
    <identifier type="doi">10.1162/tacl_a_00588</identifier>
    <location>
        <url>https://aclanthology.org/2023.tacl-1.54</url>
    </location>
    <part>
        <date>2023</date>
        <detail type="volume"><number>11</number></detail>
        <extent unit="page">
            <start>960</start>
            <end>973</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T Time-and-Space-Efficient Weighted Deduction
%A Eisner, Jason
%J Transactions of the Association for Computational Linguistics
%D 2023
%V 11
%I MIT Press
%C Cambridge, MA
%F eisner-2023-time
%X Many NLP algorithms have been described in terms of deduction systems. Unweighted deduction allows a generic forward-chaining execution strategy. For weighted deduction, however, efficient execution should propagate the weight of each item only after it has converged. This means visiting the items in topologically sorted order (as in dynamic programming). Toposorting is fast on a materialized graph; unfortunately, materializing the graph would take extra space. Is there a generic weighted deduction strategy which, for every acyclic deduction system and every input, uses only a constant factor more time and space than generic unweighted deduction? After reviewing past strategies, we answer this question in the affirmative by combining ideas of Goodman (1999) and Kahn (1962). We also give an extension to cyclic deduction systems, based on Tarjan (1972).
%R 10.1162/tacl_a_00588
%U https://aclanthology.org/2023.tacl-1.54
%U https://doi.org/10.1162/tacl_a_00588
%P 960-973

Markdown (Informal)

[Time-and-Space-Efficient Weighted Deduction](https://aclanthology.org/2023.tacl-1.54) (Eisner, TACL 2023)

• Time-and-Space-Efficient Weighted Deduction (Eisner, TACL 2023)

ACL

• Jason Eisner. 2023. Time-and-Space-Efficient Weighted Deduction. Transactions of the Association for Computational Linguistics, 11:960–973.