133 search results - page 4 / 27 » Decidable Fragments of Many-Sorted Logic |
JANCL
2002
13 years 7 months ago
2002
In [8, 6] we introduced a family of `modal' languages intended for talking about distances. These languages are interpreted in `distance spaces' which satisfy some (or a...
ATVA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
LFCS
2007
Springer
14 years 1 months ago
2007
Springer
Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues ...
TCS
2011
13 years 2 months ago
2011
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
DLOG
2008
13 years 9 months ago
2008
We show that reasoning in the temporal conceptual model ERV T , a fragment of ERV T that only allows timestamping is complete for 2-ExpTime. The membership result is based on an em...