Cover Image

Computational methods for Dynamic Answer Set Programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Hahn, Susana
Format:	Preprint
Published:	2025
Subjects:	Artificial Intelligence Formal Languages and Automata Theory Logic in Computer Science I.2.4; I.2.8
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Compiling Metric Temporal Answer Set Programming
by: Becker, Arvid, et al.
Published: (2025)

Implementing Metric Temporal Answer Set Programming
by: Becker, Arvid, et al.
Published: (2026)

Good-for-MDP State Reduction for Stochastic LTL Planning
by: Weinhuber, Christoph, et al.
Published: (2025)

Strong Equivalence in Answer Set Programming with Constraints
by: Cabalar, Pedro, et al.
Published: (2025)

Neuro-Symbolic Predictive Process Monitoring
by: Mezini, Axel, et al.
Published: (2025)

Beyond Winning Strategies: Admissible and Admissible Winning Strategies for Quantitative Reachability Games
by: Muvvala, Karan, et al.
Published: (2024)

Dynamically Reprogrammable Runtime Monitors for Bounded-time MTL
by: Hebballi, Chirantan, et al.
Published: (2026)

LTL-Constrained Policy Optimization with Cycle Experience Replay
by: Shah, Ameesh, et al.
Published: (2024)

Real-Time Model Checking for Closed-Loop Robot Reactive Planning
by: Chandler, Christopher, et al.
Published: (2025)

Reward Machines for Deep RL in Noisy and Uncertain Environments
by: Li, Andrew C., et al.
Published: (2024)

Human Conditional Reasoning in Answer Set Programming
by: Sakama, Chiaki
Published: (2023)

Parameterized Verification of Disjunctive Timed Networks
by: André, Étienne, et al.
Published: (2023)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
by: Grabmayer, Clemens
Published: (2024)

Complex Event Recognition with Symbolic Register Transducers: Extended Technical Report
by: Alevizos, Elias, et al.
Published: (2024)

Tight Verification of Probabilistic Robustness in Bayesian Neural Networks
by: Batten, Ben, et al.
Published: (2024)

Preprint: Exploring Inevitable Waypoints for Unsolvability Explanation in Hybrid Planning Problems
by: Sarwar, Mir Md Sajid, et al.
Published: (2025)

Learning Natural Language Constraints for Safe Reinforcement Learning of Language Agents
by: Chua, Jaymari, et al.
Published: (2025)

Composition Machines: Programming Self-Organising Software Models for the Emergence of Sequential Program Spaces
by: Arellanes, Damian
Published: (2021)

Active Automata Learning with Advice
by: Fica, Michał, et al.
Published: (2025)

The $μ\mathcal{G}$ Language for Programming Graph Neural Networks
by: Belenchia, Matteo, et al.
Published: (2024)

From Next Token Prediction to (STRIPS) World Models
by: Núñez-Molina, Carlos, et al.
Published: (2025)

Finding Regular Herbrand Models for CHCs using Answer Set Programming
by: Maire, Gregoire, et al.
Published: (2025)

LTL$_f$ Learning Meets Boolean Set Cover
by: Bathie, Gabriel, et al.
Published: (2025)

GOL in GOL in HOL: Verified Circuits in Conway's Game of Life
by: Myreen, Magnus O., et al.
Published: (2025)

Exploring Large Language Models for Access Control Policy Synthesis and Summarization
by: Vatsa, Adarsh, et al.
Published: (2025)

Automated Strategy Invention for Confluence of Term Rewrite Systems
by: Zhang, Liao, et al.
Published: (2024)

Meta-Programming for Linear-time Temporal Answer Set Programming
by: Hahn, Susana, et al.
Published: (2026)

AI-Oracle Machines for Intelligent Computing
by: Wang, Jie
Published: (2024)

Model-bounded monitoring of hybrid systems
by: Waga, Masaki, et al.
Published: (2021)

Bayesian scaling laws for in-context learning
by: Arora, Aryaman, et al.
Published: (2024)

Digging for Decision Trees: A Case Study in Strategy Sampling and Learning
by: Budde, Carlos E., et al.
Published: (2024)

Unsupervised Automata Learning via Discrete Optimization
by: Lutz, Simon, et al.
Published: (2023)

GraphWalk: Enabling Reasoning in Large Language Models through Tool-Based Graph Navigation
by: Ghandi, Taraneh, et al.
Published: (2026)

Systemic Constraints of Undecidability
by: Bulin, Seth
Published: (2025)

$O_2$ is a multiple context-free grammar: an implementation-, formalisation-friendly proof
by: Caminati, Marco B.
Published: (2024)

A Review of Symbolic, Subsymbolic and Hybrid Methods for Sequential Decision Making
by: Núñez-Molina, Carlos, et al.
Published: (2023)

Dynamic Programming for Symbolic Boolean Realizability and Synthesis
by: Lin, Yi, et al.
Published: (2024)

CBCL: Safe Self-Extending Agent Communication
by: O'Connor, Hugo
Published: (2026)

Learning Probabilistic Temporal Logic Specifications for Stochastic Systems
by: Roy, Rajarshi, et al.
Published: (2025)

What is Formal Verification without Specifications? A Survey on mining LTL Specifications
by: Neider, Daniel, et al.
Published: (2025)