133 search results - page 7 / 27 » Decidable Fragments of Many-Sorted Logic |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite tim...
SEMWEB
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the core of separation and spatial logics. For this, we define a complete phas...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
CADE
2001
Springer
14 years 7 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...