1650 search results - page 21 / 330 » The HOM problem is decidable |
DLOG
2010
13 years 5 months ago
2010
Abstract. This paper investigates Description Logics which allow transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. First,...
DNA
2007
Springer
14 years 1 months ago
2007
Springer
In search for “realistic” bio-inspired computing models, we consider asynchronous spiking neural P systems, in the hope to get a class of computing devices with decidable prope...
MST
2002
13 years 7 months ago
2002
In this paper we discuss the existence of an algorithm to decide if a given set of 2
LPAR
2007
Springer
14 years 1 months ago
2007
Springer
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
TARK
2007
Springer
14 years 1 months ago
2007
Springer
In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of so...