Imagen de Portada

First-Order LTLf Synthesis with Lookback (Extended Version)

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Winkler, Sarah
Formato:	Preprint
Publicado:	2025
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

LTLf Synthesis on First-Order Agent Programs in Nondeterministic Environments
por: Hofmann, Till, et al.
Publicado: (2024)

A Unified Automata-Theoretic Approach to LTLf Modulo Theories (Extended Version)
por: Faella, Marco, et al.
Publicado: (2024)

Optimal LTLf Synthesis
por: Cao, Yujian, et al.
Publicado: (2026)

On-the-fly LTLf Synthesis under Partial Observability
por: Alon, Nadav, et al.
Publicado: (2026)

Object-Centric Conformance Alignments with Synchronization (Extended Version)
por: Gianola, Alessandro, et al.
Publicado: (2023)

LTLf+ and PPLTL+: Extending LTLf and PPLTL to Infinite Traces
por: Aminof, Benjamin, et al.
Publicado: (2024)

LTLf Synthesis Under Unreliable Input
por: Hagemeier, Christian, et al.
Publicado: (2024)

A General Automata Model for First-Order Temporal Logics (Extended Version)
por: Geatti, Luca, et al.
Publicado: (2024)

A Compositional Framework for On-the-Fly LTLf Synthesis
por: Li, Yongkang, et al.
Publicado: (2025)

Efficient Probabilistic Model Checking for Relational Reachability (Extended Version)
por: Gerlach, Lina, et al.
Publicado: (2025)

Symbolic Synthesis for LTLf+ Obligations
por: De Giacomo, Giuseppe, et al.
Publicado: (2026)

Computing unsatisfiable cores for LTLf specifications
por: Roveri, Marco, et al.
Publicado: (2022)

Tableaux for Automated Reasoning in Dependently-Typed Higher-Order Logic (Extended Version)
por: Niederhauser, Johannes, et al.
Publicado: (2024)

To bind or not to bind? Discovering Stable Relationships in Object-centric Processes (Extended Version)
por: Seidel, Anjo, et al.
Publicado: (2025)

Enumerating Minimal Unsatisfiable Cores of LTLf formulas
por: Ielo, Antonio, et al.
Publicado: (2024)

Unravelling Cyclic First-Order Arithmetic
por: Leigh, Graham E., et al.
Publicado: (2025)

Contextual Refinement of Higher-Order Concurrent Probabilistic Programs (Extended Version)
por: Li, Kwing Hei, et al.
Publicado: (2025)

Do It for HER: First-Order Temporal Logic Reward Specification in Reinforcement Learning (Extended Version)
por: Olivieri, Pierriccardo, et al.
Publicado: (2026)

Putting Perspective into OWL [sic]: Complexity-Neutral Standpoint Reasoning for Ontology Languages via Monodic S5 over Counting Two-Variable First-Order Logic (Extended Version with Appendix)
por: Álvarez, Lucía Gómez, et al.
Publicado: (2025)

Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis
por: Hausmann, Daniel, et al.
Publicado: (2025)

Solving MDPs with LTLf+ and PPLTL+ Temporal Objectives
por: De Giacomo, Giuseppe, et al.
Publicado: (2025)

Modular Verification of Differential Privacy in Probabilistic Higher-Order Separation Logic (Extended Version)
por: Haselwarter, Philipp G., et al.
Publicado: (2026)

Sharing and Linear Logic with Restricted Access (Extended Version)
por: Barenbaum, Pablo, et al.
Publicado: (2025)

Formulas as Processes, Deadlock-Freedom as Choreographies (Extended Version)
por: Acclavio, Matteo, et al.
Publicado: (2025)

A Hyperlogic for Strategies in Stochastic Games (Extended Version)
por: Gerlach, Lina, et al.
Publicado: (2025)

Practical Deductive Verification of OCaml Programs (Extended Version)
por: Pereira, Mário
Publicado: (2024)

Towards Proving Liveness on Weak Memory (Extended Version)
por: Bargmann, Lara, et al.
Publicado: (2026)

Satisfiability Modulo Extensional Constant Arrays (Extended Version)
por: Preiner, Mathias, et al.
Publicado: (2026)

Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory [Extended Version]
por: Kettmann, Pascal, et al.
Publicado: (2026)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
por: Artale, Alessandro, et al.
Publicado: (2025)

Certified Branch-and-Bound MaxSAT Solving (Extended Version)
por: Vandesande, Dieter, et al.
Publicado: (2025)

Equational Reasoning Modulo Commutativity in Languages with Binders (Extended Version)
por: Caires-Santos, Ali K., et al.
Publicado: (2025)

Model Checking as Program Verification by Abstract Interpretation (Extended Version)
por: Baldan, Paolo, et al.
Publicado: (2025)

Partially Finite Model Reasoning in Description Logics Extended Version
por: Gogacz, Tomasz, et al.
Publicado: (2026)

Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)
por: Paulus, Joseph W. N., et al.
Publicado: (2021)

A Framework for Coalgebraic Reward-Sensitive Bisimulation (Extended Version)
por: de Amorim, Pedro H. Azevedo, et al.
Publicado: (2026)

Mechanized Undecidability of Higher-order beta-Matching (Extended Version)
por: Dudenhefner, Andrej
Publicado: (2026)

Unification of Deterministic Higher-Order Patterns (Full Version)
por: Niederhauser, Johannes, et al.
Publicado: (2026)

Measuring Rule-based LTLf Process Specifications: A Probabilistic Data-driven Approach
por: Cecconi, Alessio, et al.
Publicado: (2023)

The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting (Full Version)
por: Niederhauser, Johannes, et al.
Publicado: (2025)