851 search results - page 13 / 171 » Inaccessibility in Decision Procedures |
84
Voted
FROCOS
2007
Springer
15 years 4 months ago
2007
Springer
Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability ...
108
Voted
LATIN
2004
Springer
15 years 3 months ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
114
Voted
SBMF
2010
Springer
14 years 5 months ago
2010
Springer
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed ...
102
Voted
CADE
2004
Springer
15 years 10 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...