Sciweavers

133 search results - page 1 / 27
» Decidable Fragments of Many-Sorted Logic
Sort
View
LPAR
2007
Springer
13 years 11 months ago
Decidable Fragments of Many-Sorted Logic
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of m...
Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sa...
FROCOS
2005
Springer
13 years 10 months ago
Connecting Many-Sorted Structures and Theories Through Adjoint Functions
In a previous paper, we have introduced a general approach for connecting two many-sorted theories through connection functions that behave like homomorphisms on the shared signatu...
Franz Baader, Silvio Ghilardi
CADE
2005
Springer
14 years 5 months ago
Connecting Many-Sorted Theories
Abstract. Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must...
Franz Baader, Silvio Ghilardi
SLOGICA
2008
99views more  SLOGICA 2008»
13 years 3 months ago
Decidable Cases of First-order Temporal Logic with Functions
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
Walter Hussak
ICALP
2010
Springer
13 years 2 months ago
Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals
In this paper, we focus our attention on the fragment of Halpern and Shoham's modal logic of intervals (HS) that features four modal operators corresponding to the relations &...
Angelo Montanari, Gabriele Puppis, Pietro Sala