:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Overbeek, Roy, Endrullis, Jörg
Format:	Preprint
Publié:	2023
Sujets:	Logic in Computer Science
Accès en ligne:	https://arxiv.org/abs/2303.07812
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Termination of Graph Transformation Systems via Generalized Weighted Type Graphs
par: Endrullis, Jörg, et autres
Publié: (2023)

Characterisation of Lawvere-Tierney Topologies on Simplicial Sets, Bicolored Graphs, and Fuzzy Sets
par: Rosset, Aloïs, et autres
Publié: (2024)

Correspondence between Composite Theories and Distributive Laws
par: Rosset, Aloïs, et autres
Publié: (2024)

Proceedings of the Fourteenth and Fifteenth International Workshop on Graph Computation Models
par: Endrullis, Jörg, et autres
Publié: (2025)

Complete and Terminating Tableau Calculus for Undirected Graph
par: Nishimura, Yuki, et autres
Publié: (2024)

Terminating Hybrid Tableaus for Ordered Models
par: Nishimura, Yuki
Publié: (2025)

Complexity of Weighted First-Order Model Counting in the Two-Variable Fragment with Counting Quantifiers: A Bound to Beat
par: Tóth, Jan, et autres
Publié: (2024)

Non-Termination of Logic Programs Using Patterns
par: Payet, Etienne
Publié: (2025)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
par: Mählmann, Nikolas
Publié: (2025)

Paraconsistent Existential Graphs Gamma Peirce System
par: Sierra-Aristizabal, Manuel
Publié: (2023)

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting
par: Lichter, Moritz
Publié: (2022)

Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
par: Baader, Franz, et autres
Publié: (2024)

Numerical Considerations in Weighted Model Counting
par: Bryant, Randal E.
Publié: (2025)

Hydra Battles and AC Termination
par: Hirokawa, Nao, et autres
Publié: (2023)

Termination of Triangular Polynomial Loops
par: Hark, Marcel, et autres
Publié: (2019)

Counterexample-Guided Abstraction Refinement for Generalized Graph Transformation Systems (Full Version)
par: König, Barbara, et autres
Publié: (2025)

Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations
par: Lyon, Tim S.
Publié: (2024)

Deciding Termination of Simple Randomized Loops
par: Meyer, Éléanore, et autres
Publié: (2025)

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
par: Neuen, Daniel, et autres
Publié: (2026)

Sound and Complete Proof Rules for Probabilistic Termination
par: Majumdar, Rupak, et autres
Publié: (2024)

Transformers Can Learn Connectivity in Some Graphs but Not Others
par: Roy, Amit, et autres
Publié: (2025)

Deductive Systems for Logic Programs with Counting
par: Fandinno, Jorge, et autres
Publié: (2025)

Termination of Real Linear Loops
par: Neumann, Eike, et autres
Publié: (2026)

Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems
par: Ahrens, Emma, et autres
Publié: (2025)

Subgraph Isomorphism: Prolog vs. Conventional
par: Yin, Claire Y., et autres
Publié: (2025)

Positive Almost-Sure Termination of Polynomial Random Walks
par: Winkler, Lorenz, et autres
Publié: (2025)

Field Knowledge as a Dual to Distributed Knowledge: A Characterization by Weighted Modal Logic
par: Liang, Xiaolong, et autres
Publié: (2024)

When Do You Start Counting? Revisiting Counting and Pnueli Modalities in Timed Logics
par: Ho, Hsi-Ming, et autres
Publié: (2024)

Formalising the Double-Pushout Approach to Graph Transformation
par: Söldner, Robert, et autres
Publié: (2023)

Chase Termination Beyond Polynomial Time
par: Hanisch, Philipp, et autres
Publié: (2024)

A Dependency Pair Framework for Relative Termination of Term Rewriting
par: Kassing, Jan-Christoph, et autres
Publié: (2024)

Using Color Refinement to Boost Enumeration and Counting for Acyclic CQs of Binary Schemas
par: Riveros, Cristian, et autres
Publié: (2024)

On Lower Bounding Minimal Model Count
par: Kabir, Mohimenul, et autres
Publié: (2024)

AProVE: Modular Termination Analysis of Memory-Manipulating C Programs
par: Emrich, Frank, et autres
Publié: (2023)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
par: Kassing, Jan-Christoph, et autres
Publié: (2023)

Efficient Ranking Function-Based Termination Analysis with Bi-Directional Feedback
par: Sarita, Yasmin, et autres
Publié: (2024)

Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformers
par: Yang, Andy, et autres
Publié: (2024)

Type-Based Termination for Futures
par: Somayyajula, Siva, et autres
Publié: (2021)

Minimal Model Counting via Knowledge Compilation
par: Kabir, Mohimenul
Publié: (2024)

On Top-Down Pseudo-Boolean Model Counting
par: Yang, Suwei, et autres
Publié: (2025)