paper-with-me

Papers

Grounding Recursive Aggregates: Preliminary Report

2016-03-12 · Martin Gebser, Roland Kaminski, Torsten Schaub

Problem solving in Answer Set Programming consists of two steps, a first grounding phase, systematically replacing all variables by terms, and a second solving phase computing the stable models of the obtained ground program. An intricate part of both phases is the treatment of aggregates, which are popular language constructs that allow for expressing properties over sets. In this paper, we elaborate upon the treatment of aggregates during grounding in Gringo series 4. Consequently, our approach is applicable to grounding based on semi-naive database evaluation techniques. In particular, we provide a series of algorithms detailing the treatment of recursive aggregates and illustrate this by a running example.

📄 PDF Abstract BibTeX arXiv:1603.03884

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

On the Foundations of Grounding in Answer Set Programming

2021-08-10 · Roland Kaminski, Torsten Schaub

We provide a comprehensive elaboration of the theoretical foundations of variable instantiation, or grounding, in Answer Set Programming (ASP). Building on the semantics of ASP's modeling language, we introduce a formal …

Rewriting recursive aggregates in answer set programming: back to monotonicity

2015-07-14 · Mario Alviano, Wolfgang Faber, Martin Gebser

Aggregation functions are widely used in answer set programming for representing and reasoning on knowledge involving sets of objects collectively. Current implementations simplify the structure of programs in order to o…

Translation

Generative AI in K-12 Classrooms: A Midyear Implementation Report

2026-04-08 · Lief Esbenshade, Alex Liu, Michael Xiao, Zewei Tian 외 arxiv

This mid-year report summarizes teacher use of Colleague AI across 12 Washington State school districts from September 1 to December 31, 2025. Produced jointly by Colleague AI and AmplifyLearn.AI at the University of Was…

Interaction Locality in Hierarchical Recursive Reasoning

2026-05-20 · Yosuke Miyanishi, Tetsuro Morimura arxiv

Spatial reasoning requires both location-bound computation and location-invariant structure: agents must make local moves while preserving route, object, or constraint-level plans. We propose interaction locality, a task…

Spatial Reasoning

Lightweight Polyp Segmentation via a Gain-Aware Prediction-Space Recursive Controller

2026-07-03 · Jiachi Zhang, Zhuoyu Wu, Quanjun Wang, Wenhui Ou 외 arxiv

While lightweight polyp segmentation is highly desirable for low-cost deployment, reported performance gains often stem from upgraded backbone encoders, complex decoders, or heavy refinement branches. Consequently, it re…

Polyp Segmentation