Locality transfer: from constrained axiomatizations to reachability predicates

DOI10.1007/978-3-319-08587-6_14zbMATH Open1423.68420OpenAlexW1808894010MaRDI QIDQ3192190FDOQ3192190

Authors: Matthias Horbach, Viorica Sofronie-Stokkermans 

Publication date: 26 September 2014

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08587-6_14

Recommendations

• Obtaining Finite Local Theory Axiomatizations via Saturation
• Automated complexity analysis based on ordered resolution
• A resolution principle for constrained logics
• Local entailment test in the reachability problem for well-structured transition systems
• Some fundamental properties of local constraint propagation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (3)

• Symbol elimination and applications to parametric entailment problems
• On invariant synthesis for parametric systems
• Axiomization of passage from “local” structure to “global” object

This page was built for publication: Locality transfer: from constrained axiomatizations to reachability predicates

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