Pith. sign in

REVIEW 2 cited by

Answer Set Networks: Casting Answer Set Programming into Deep Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.14814 v1 pith:LMYJ236P submitted 2024-12-19 cs.AI cs.LGcs.SC

Answer Set Networks: Casting Answer Set Programming into Deep Learning

classification cs.AI cs.LGcs.SC
keywords asnsanswernesynetworksprogrammingcpu-bounddeepdemonstrate
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Although Answer Set Programming (ASP) allows constraining neural-symbolic (NeSy) systems, its employment is hindered by the prohibitive costs of computing stable models and the CPU-bound nature of state-of-the-art solvers. To this end, we propose Answer Set Networks (ASN), a NeSy solver. Based on Graph Neural Networks (GNN), ASNs are a scalable approach to ASP-based Deep Probabilistic Logic Programming (DPPL). Specifically, we show how to translate ASPs into ASNs and demonstrate how ASNs can efficiently solve the encoded problem by leveraging GPU's batching and parallelization capabilities. Our experimental evaluations demonstrate that ASNs outperform state-of-the-art CPU-bound NeSy systems on multiple tasks. Simultaneously, we make the following two contributions based on the strengths of ASNs. Namely, we are the first to show the finetuning of Large Language Models (LLM) with DPPLs, employing ASNs to guide the training with logic. Further, we show the "constitutional navigation" of drones, i.e., encoding public aviation laws in an ASN for routing Unmanned Aerial Vehicles in uncertain environments.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Streamliners for Answer Set Programming

    cs.LO 2026-04 unverdicted novelty 7.0

    LLM-proposed streamliner constraints for ASP encodings, filtered and combined via virtual best selection, deliver up to 4-5x speedups on three competition benchmarks.

  2. Streamliners for Answer Set Programming

    cs.LO 2026-04 conditional novelty 6.0

    LLM-generated streamliners, filtered and selected by an automated pipeline, give up to 4–5× speedups under a per-instance virtual best encoding on three ASP benchmarks.