Cover Image

Extracting Policies from Quantified Answer Set Programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Diéguez, Martín, Stéphan, Igor
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Logic of Sets with Atoms
by: Masters, Jake
Published: (2025)

Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
by: Pratt-Hartmann, Ian
Published: (2004)

SM-based Semantics for Answer Set Programs Containing Conditional Literals and Arithmetic
by: Hansen, Zachary, et al.
Published: (2025)

Two-Level Type Theory and Applications
by: Annenkov, Danil, et al.
Published: (2017)

Complexity of Łukasiewicz Modal Probabilistic Logics
by: Kozhemiachenko, Daniil, et al.
Published: (2025)

CoLF Logic Programming as Infinitary Proof Exploration
by: Chen, Zhibo, et al.
Published: (2025)

The Lambda Calculus is Quantifiable
by: Maestracci, Valentin, et al.
Published: (2024)

Satisfiability in Łukasiewicz logic and its unbounded relative
by: Haniková, Zuzana, et al.
Published: (2025)

Semi-Substructural Logics à la Lambek
by: Wan, Cheng-Syuan
Published: (2024)

A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic
by: Becker, Justus
Published: (2025)

A Topological Rewriting of Tarski's Mereogeometry
by: Barlatier, Patrick, et al.
Published: (2025)

Extensions of K5: Proof Theory and Uniform Lyndon Interpolation
by: van der Giessen, Iris, et al.
Published: (2023)

Cardinality and Representation of Stone Relation Algebras
by: Furusawa, Hitoshi, et al.
Published: (2023)

Satisfiability for Knowing How over Linear Plans is NP-complete
by: Areces, Carlos, et al.
Published: (2026)

Apply2Isar: Automatically Converting Isabelle/HOL Apply-Style Proofs to Structured Isar
by: Binder, Sage, et al.
Published: (2026)

Sensible Intersection Type Theories
by: Dezani-Ciancaglini, Mariangiola, et al.
Published: (2026)

Polymorphism Meets DHOL
by: Ranalter, Rhea, et al.
Published: (2026)

Two Remarks about Game Semantics of Classical Logic
by: Coquand, Thierry
Published: (2026)

Computation and Size of Interpolants for Hybrid Modal Logics
by: Jung, Jean Christoph, et al.
Published: (2026)

The Guarded Fragment with Nested Equivalences
by: Fiuk, Oskar
Published: (2026)

The Latent Space of Equational Theories
by: Berlioz, Luis, et al.
Published: (2026)

Uniform Realizability Interpretations
by: Berger, Ulrich, et al.
Published: (2026)

An Unconventional View on Beta-Reduction in Namefree Lambda-Calculus
by: Nederpelt, Rob, et al.
Published: (2026)

Auto formalisation of Goedel's Second Incompleteness Theorem in Binary Recursive Arithmetic
by: Coquand, Thierry
Published: (2026)

Dependently Sorted Nominal Signatures
by: Fernández, Maribel, et al.
Published: (2025)

A Construction of the Lie Algebra of a Lie Group in Isabelle/HOL
by: Schmoetten, Richard, et al.
Published: (2024)

The mu-calculus' Alternation Hierarchy is Strict over Non-Trivial Fusion Logics
by: Pacheco, Leonardo
Published: (2025)

Who Wins the Multi-Structural Game?
by: Fagin, Ronald, et al.
Published: (2025)

A Curiously Effective Backtracking Strategy for Connection Tableaux
by: Färber, Michael
Published: (2021)

The Limit of Recursion in State-based Systems
by: Afshari, Bahareh, et al.
Published: (2025)

Efficient Normalization of Linear Temporal Logic
by: Esparza, Javier, et al.
Published: (2023)

Scroll nets
by: Donato, Pablo
Published: (2025)

Type Theory with Single Substitutions
by: Kaposi, Ambrus, et al.
Published: (2025)

A Unified Gentzen-style Framework for Until-free LTL
by: Kamide, Norihiro, et al.
Published: (2024)

Unified Gentzen Approach to Connexive Logics over Wansing's C
by: Kamide, Norihiro
Published: (2024)

A topological counterpart of well-founded trees in dependent type theory
by: Maietti, Maria Emilia, et al.
Published: (2023)

On the (In-)Completeness of Destructive Equality Resolution in the Superposition Calculus
by: Waldmann, Uwe
Published: (2024)

The Dependently Typed Higher-Order Form for the TPTP World
by: Ranalter, Daniel, et al.
Published: (2025)

Input-based Three-valued Abstraction Refinement
by: Onderka, Jan, et al.
Published: (2024)

Characterization of Lattice Properties Within Modal Extensions
by: Freire, Alfredo R., et al.
Published: (2025)