23 search results - page 1 / 5 » A decision procedure for a decidable fragment of generalized... |
VLC
2011
12 years 11 months ago
2011
Constraint diagrams were introduced by Kent, in 1997, as an alternative to the OCL for placing formal constraints on software models. Since their introduction, constraint diagrams...
FROCOS
2005
Springer
13 years 10 months ago
2005
Springer
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
CADE
2001
Springer
14 years 5 months ago
2001
Springer
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
CADE
2005
Springer
14 years 5 months ago
2005
Springer
In this paper we study the decidability of various fragments of monodic first-order temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic tempo...
ATVA
2010
Springer
13 years 6 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 ...