19 search results - page 2 / 4 » A decision procedure for subset constraints over regular lan... |
DIAGRAMS
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
ENTCS
2002
13 years 5 months ago
2002
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
MST
2010
13 years 3 months ago
2010
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
ICDT
2003
ACM
13 years 10 months ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
IANDC
2007
13 years 5 months ago
2007
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...