305 search results - page 10 / 61 » Decidability of Split Equivalence |
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...
TIP
2010
13 years 2 months ago
2010
We propose a new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where t...
RTA
1998
Springer
13 years 12 months ago
1998
Springer
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...
ICLP
2003
Springer
14 years 26 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...
JSC
2010
13 years 6 months ago
2010
We study the problem of deciding whether two ontologies are inseparable w.r.t. a signature Σ, i.e., whether they have the same consequences in the signature Σ. A special case is...