Sciweavers

232 search results - page 2 / 47
» Completeness and Decidability in Sequence Logic
Sort
View
TIME
2005
IEEE
14 years 29 days ago
Axiomatisation and Decidability of Multi-dimensional Duration Calculus
We investigate properties of a spatio-temporal logic based on an n-dimensional Duration Calculus tailored for the specification and verification of mobile real-time systems. Aft...
Andreas Schäfer
DLOG
2007
13 years 9 months ago
Deciding ALBO with Tableau
Abstract. This paper presents a tableau approach for deciding description logics outside the scope of OWL DL and current state-of-the-art tableau-based description logic systems. I...
Renate A. Schmidt, Dmitry Tishkovsky
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
13 years 8 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
TACS
2001
Springer
13 years 11 months ago
Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness
Abstract. We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and the...
Hiroshi Nakano
KR
2004
Springer
14 years 22 days ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget