Copertina

Terminating Hybrid Tableaus for Ordered Models

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Nishimura, Yuki
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Logic Logic in Computer Science
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Agent-Knowledge Logic for Alternative Epistemic Logic
di: Nishimura, Yuki
Pubblicazione: (2024)

Completeness of Tableau Calculi for Two-Dimensional Hybrid Logics
di: Nishimura, Yuki
Pubblicazione: (2022)

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

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

Term Ordering Diagrams
di: Hajdu, Márton, et al.
Pubblicazione: (2025)

Hydra Battles and AC Termination
di: Hirokawa, Nao, et al.
Pubblicazione: (2023)

Termination of Triangular Polynomial Loops
di: Hark, Marcel, et al.
Pubblicazione: (2019)

Prime Factorization in Models of PV$_1$
di: Ježil, Ondřej
Pubblicazione: (2025)

Modelling of logical systems by means of their fragments
di: Rybakov, Mikhail
Pubblicazione: (2025)

A Logic of Secrecy on Simplicial Models
di: Wang, Shanxia
Pubblicazione: (2026)

The Pebble-Relation Comonad in Finite Model Theory
di: Montacute, Yoàv, et al.
Pubblicazione: (2021)

Embedded Finite Models Beyond Restricted Quantifier Collapse
di: Benedikt, Michael, et al.
Pubblicazione: (2023)

Deciding Termination of Simple Randomized Loops
di: Meyer, Éléanore, et al.
Pubblicazione: (2025)

Complexity of the Model Checking problem for inquisitive propositional and modal logic
di: Grilletti, Gianluca, et al.
Pubblicazione: (2024)

Bifurcation Logic: Separation Through Ordering
di: Galmiche, Didier, et al.
Pubblicazione: (2025)

Non-Termination of Logic Programs Using Patterns
di: Payet, Etienne
Pubblicazione: (2025)

Sound and Complete Proof Rules for Probabilistic Termination
di: Majumdar, Rupak, et al.
Pubblicazione: (2024)

A Formal Model to Prove Instantiation Termination for E-matching-Based Axiomatisations (Extended Version)
di: Ge, Rui, et al.
Pubblicazione: (2024)

Positive Almost-Sure Termination of Polynomial Random Walks
di: Winkler, Lorenz, et al.
Pubblicazione: (2025)

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

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

A Dependency Pair Framework for Relative Termination of Term Rewriting
di: Kassing, Jan-Christoph, et al.
Pubblicazione: (2024)

Termination of Graph Transformation Systems Using Weighted Subgraph Counting
di: Overbeek, Roy, et al.
Pubblicazione: (2023)

Ordered Completion for Non-Locally Tight mini-gringo Programs
di: Heuer, Jan
Pubblicazione: (2025)

Bennett's Conjecture in Lean 4: Counter-Models for the PSR-Reducibility of Spinoza's Propositions V and XIV
di: Nakamura, Yuki
Pubblicazione: (2026)

AProVE: Modular Termination Analysis of Memory-Manipulating C Programs
di: Emrich, Frank, et al.
Pubblicazione: (2023)

Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
di: Baader, Franz, et al.
Pubblicazione: (2024)

Efficient Ranking Function-Based Termination Analysis with Bi-Directional Feedback
di: Sarita, Yasmin, et al.
Pubblicazione: (2024)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
di: Kassing, Jan-Christoph, et al.
Pubblicazione: (2023)

Termination of Graph Transformation Systems via Generalized Weighted Type Graphs
di: Endrullis, Jörg, et al.
Pubblicazione: (2023)

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
di: Kassing, Jan-Christoph, et al.
Pubblicazione: (2024)

The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
di: Kassing, Jan-Christoph, et al.
Pubblicazione: (2024)

Comparing and Contrasting Arrow's Impossibility Theorem and Gödel's Incompleteness Theorem
di: Livson, Ori, et al.
Pubblicazione: (2025)

A study of cut-elimination for a non-labelled cyclic proof system for propositional dynamic logics
di: Oda, Yukihiro
Pubblicazione: (2025)

Abstract computation over first-order structures. Part IIa: Moschovakis' operator and other non-determinisms
di: Gaßner, Christine
Pubblicazione: (2025)

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

Proof-theoretic Semantics for Second-order Logic
di: Gheorghiu, Alexander V., et al.
Pubblicazione: (2025)

Many-valued coalgebraic dynamic logics: Safety and strong completeness via reducibility
di: Hansen, Helle Hvid, et al.
Pubblicazione: (2025)

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