232 search results - page 8 / 47 » Completeness and Decidability in Sequence Logic |
ICLP
2003
Springer
14 years 18 days ago
2003
Springer
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
IJIS
2011
12 years 10 months ago
2011
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
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...