Copertina

A Formal Model to Prove Instantiation Termination for E-matching-Based Axiomatisations (Extended Version)

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Ge, Rui, Garcia, Ronald, Summers, Alexander J.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Logic in Computer Science
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

A Complete Quantitative Axiomatisation of Behavioural Distance of Regular Expressions
di: Różowski, Wojciech
Pubblicazione: (2024)

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

Dichotomy for Axiomatising Inclusion Dependencies on K-Databases
di: Hannula, Miika, et al.
Pubblicazione: (2026)

From MBQI to Enumerative Instantiation and Back
di: Dančo, Marek, et al.
Pubblicazione: (2025)

Quantitative Monoidal Algebra: Axiomatising Distance with String Diagrams
di: Lobbia, Gabriele, et al.
Pubblicazione: (2024)

Axiomatisation for an asynchronous epistemic logic with sending and receiving messages
di: Balbiani, Philippe, et al.
Pubblicazione: (2025)

Complete Diagrammatic Axiomatisations of Relative Entropy
di: Sarkis, Ralph, et al.
Pubblicazione: (2026)

MSC-180: A Benchmark for Automated Formal Theorem Proving from Mathematical Subject Classification
di: Li, Sirui, et al.
Pubblicazione: (2025)

Exploiting Instantiations from Paramodulation Proofs in Isabelle/HOL
di: Bartl, Lukas, et al.
Pubblicazione: (2025)

Quantifier Instantiations: To Mimic or To Revolt?
di: Jakubův, Jan, et al.
Pubblicazione: (2025)

täkōFormal: Enabling Robust Software for Programmable Memory Hierarchies (Extended Version)
di: Srinivasan, Pranav, et al.
Pubblicazione: (2026)

Enhancing Formal Theorem Proving: A Comprehensive Dataset for Training AI Models on Coq Code
di: Florath, Andreas
Pubblicazione: (2024)

Terminating Hybrid Tableaus for Ordered Models
di: Nishimura, Yuki
Pubblicazione: (2025)

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

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

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

What are the Right Symmetries for Formal Theorem Proving?
di: Olejniczak, Krzysztof, et al.
Pubblicazione: (2026)

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

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

Weak Simplicial Bisimilarity for Polyhedral Models and SLCS_eta -- Extended Version
di: Bezhanishvili, Nick, et al.
Pubblicazione: (2024)

Proving Behavioural Apartness
di: Turkenburg, Ruben, et al.
Pubblicazione: (2024)

LeanAgent: Lifelong Learning for Formal Theorem Proving
di: Kumarappan, Adarsh, et al.
Pubblicazione: (2024)

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

Beyond Theorem Proving: Formulation, Framework and Benchmark for Formal Problem-Solving
di: Liu, Qi, et al.
Pubblicazione: (2025)

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

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

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

First-Order LTLf Synthesis with Lookback (Extended Version)
di: Winkler, Sarah
Pubblicazione: (2025)

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

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic (Extended Abstract)
di: Gheorghiu, Alexander V., et al.
Pubblicazione: (2023)

On the Complexity of Proving Polyhedral Reductions
di: Amat, Nicolas, et al.
Pubblicazione: (2023)

A Diagrammatic Axiomatisation of Behavioural Distance of Nondeterministic Processes
di: Różowski, Wojciech, et al.
Pubblicazione: (2026)

A set-theoretical approach for ABox reasoning services (Extended Version)
di: Cantone, Domenico, et al.
Pubblicazione: (2017)

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

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

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

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

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

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