Cited by 17Logic, Reasoning, and KnowledgeLogic, programming, and type systemsAdvanced Algebra and Logic

First-order answer set programming as constructive proof search

Open access
Schubert, Aleksy, Urzyczyn, Pawel·2018·EasyChair Preprints

Abstract

We propose an interpretation of the first-order answer set programming (FOASP) in terms of intuitionistic proof theory. It is obtained by two polynomial translations between FOASP and the bounded-arity fragment of the \Sigma_1 level of the Mints hierarchy in first-order intuitionistic logic. It follows that \Sigma_1 formulas using predicates of fixed arity (in particular unary) are of the same strength as FOASP. Our construction reveals a close similarity between constructive provability and stable entailment, or equivalently, between the construction of an answer set and an intuitionistic refutation.

Integrity signals

Registry

Crossref · 10.29007/9qvn

Cites

15 of 15 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Conventional multimodal backbones are generally not flexible, and explicit fusion requires the presence of all modalities; missing any modality will break the training pipeline.

    “Conventional backbones [31,39] are generally not flexible.”

    From Are Multimodal Transformers Robust to Missing Modality? (2022) · cites this paper as [39]

Cites

Flagged first, then by citations

1 of the 16 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Schubert, A., & Urzyczyn, P.
Affiliations
University of Warsaw (PL)
Venue
EasyChair Preprints
Publisher
EasyChair
Published
2018-05-31
Volume
18
Issue
3-4
Pages
673-690
ISSN
  • 1471-0684 (ISSN-L)
  • 2516-2314
OpenAlex
W2799131411
Cited by
17
References
16
Citations by year
2025: 5 · 2024: 3 · 2023: 3 · 2022: 3 · 2021: 1 · 2020: 1 · 2019: 1
FWCI
0.42
Type
journal article
Language
en
Open access
Locations
  • Theory and Practice of Logic Programming (publishedVersion)
  • EasyChair preprint (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Algebra and Logic
Keywords
translation between logics

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review