133 search results - page 26 / 27 » Decidable Fragments of Many-Sorted Logic |
ESOP
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
TACAS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
JAR
2006
13 years 7 months ago
2006
Abstract. As products are growing more complex, so is their documentation. With an increasing number of product options, the diversity in service and maintenance procedures grows a...
RTA
2005
Springer
14 years 25 days ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...