Cover Image

Ordered Completion for Non-Locally Tight mini-gringo Programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Heuer, Jan
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic
by: Heuer, Jan, et al.
Published: (2024)

Automated Verification of Equivalence Properties in Advanced Logic Programs -- Bachelor Thesis
by: Heuer, Jan
Published: (2023)

Completeness of Relational Algebra via Cylindric Algebra
by: Laštovička, Jan
Published: (2026)

Terminating Hybrid Tableaus for Ordered Models
by: Nishimura, Yuki
Published: (2025)

Complete Local Reasoning About Parameterized Programs Over Topologies
by: Cheng, Ruotong, et al.
Published: (2026)

Complete Dynamic Logic of Communicating Hybrid Programs
by: Brieger, Marvin, et al.
Published: (2024)

On the Completeness of Interpolation Algorithms
by: Hetzl, Stefan, et al.
Published: (2024)

Internal and External Calculi: Ordering the Jungle without Being Lost in Translations
by: Lyon, Tim S., et al.
Published: (2023)

Targeting Completeness: Automated Complexity Analysis of Integer Programs
by: Lommen, Nils, et al.
Published: (2024)

Completions of Kleene's second model
by: Terwijn, Sebastiaan A.
Published: (2023)

Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
by: Lommen, Nils, et al.
Published: (2023)

Complete and Terminating Tableau Calculus for Undirected Graph
by: Nishimura, Yuki, et al.
Published: (2024)

Term Ordering Diagrams
by: Hajdu, Márton, et al.
Published: (2025)

Proof-Theoretic Functional Completeness for the Connexive Logic C
by: Ayhan, Sara, et al.
Published: (2025)

A Complete Finite Axiomatisation of the Equational Theory of Common Meadows
by: Bergstra, Jan A, et al.
Published: (2023)

Some General Completeness Results for Propositionally Quantified Modal Logics
by: Ding, Yifeng, et al.
Published: (2024)

Complete representation by partial functions for signatures containing antidomain restriction
by: McLean, Brett
Published: (2023)

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions
by: Indrzejczak, Andrzej, et al.
Published: (2024)

Bifurcation Logic: Separation Through Ordering
by: Galmiche, Didier, et al.
Published: (2025)

Non-Termination of Logic Programs Using Patterns
by: Payet, Etienne
Published: (2025)

The Relational Quotient Completion
by: Dagnino, Francesco, et al.
Published: (2024)

FO-Complete Program Verification for Heap Logics
by: Murali, Adithya, et al.
Published: (2026)

Anthem 2.0: Automated Reasoning for Answer Set Programming
by: Fandinno, Jorge, et al.
Published: (2025)

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Translating Workflow Nets into the Partially Ordered Workflow Language
by: Kourani, Humam, et al.
Published: (2025)

Two-Variable Logic for Hierarchically Partitioned and Ordered Data
by: Fiuk, Oskar, et al.
Published: (2025)

Revisiting Assumptions Ordering in CAR-Based Model Checking
by: Dong, Yibo, et al.
Published: (2024)

An Empirical Study of Rational Tree Unification for miniKanren
by: Domoratskiy, Eridan, et al.
Published: (2025)

Solving Fuzzy Satisfiability via Mixed-Integer Non-Linear Programming
by: Castro, Pablo F.
Published: (2026)

Program Synthesis is $Σ_3^0$-Complete
by: Kim, Jinwoo
Published: (2024)

A Complete Formal Specification and Verification of the BESW software control system of the Maeslant Storm Surge Barrier
by: Beers, Adrian, et al.
Published: (2025)

Autonomous Task Completion Based on Goal-directed Answer Set Programming
by: Tudor, Alexis R.
Published: (2025)

Non-Derivability Results in Polymorphic Dependent Type Theory
by: Geuvers, Herman
Published: (2026)

Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
by: Lommen, Nils, et al.
Published: (2022)

Programs as Singularities
by: Murfet, Daniel, et al.
Published: (2025)

The Constructive $μ$-calculus: Game Semantics and Non-Wellfounded Proof Systems
by: Pacheco, Leonardo
Published: (2026)

Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs
by: Chatterjee, Krishnendu, et al.
Published: (2024)

Complete Symmetry Breaking for Finite Models
by: Dančo, Marek, et al.
Published: (2025)

Relative Completeness of Incorrectness Separation Logic
by: Lee, Yeonseok, et al.
Published: (2025)

On Complete Categorical Semantics for Effect Handlers
by: Kura, Satoshi
Published: (2026)