Automatic Decidability and Combinability Revisited

DOI10.1007/978-3-540-73595-3_22MaRDI QIDQ3608782zbMATH OpenOpenAlexFDO

Authors

Publication date 6 March 2009

Published in Automated Deduction – CADE-21 (Search for Journal in Brave)

Full work available at URL http://edoc.mpg.de/356501

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Automatic decidability and combinability
• Automatic decidability: a schematic calculus for theories with counting operators
• Automatic Combinability of Rewriting-Based Satisfiability Procedures
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
• Developments in Language Theory
• scientific article; zbMATH DE number 1342250
• On decidability of the completeness problem for special systems of automaton functions
• Decidability, introduction rules and automata
• AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES
• Automated Compositional Reasoning of Intuitionistically Closed Regular Properties

Cited in

(11)

• Theory decision by decomposition
• On the use of autarkies for satisfiability decision
• Automatic decidability: a schematic calculus for theories with counting operators
• Satisfiability Procedures for Combination of Theories Sharing Integer Offsets
• Data structures with arithmetic constraints: A non-disjoint combination
• An instantiation scheme for satisfiability modulo theories
• Variant-Based Satisfiability in Initial Algebras
• Decidability and Enumeration for Automatic Sequences: A Survey
• scientific article; zbMATH DE number 1396671 (Why is no real title available?)
• Combinable Extensions of Abelian Groups
• Automatic decidability and combinability

This page was built for publication: Automatic Decidability and Combinability Revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608782)