305 search results - page 10 / 61 » Decidability of Split Equivalence |
152
click to vote
DNA
2007
Springer
15 years 8 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...
119
Voted
TIP
2010
14 years 8 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...
107
Voted
RTA
1998
Springer
15 years 6 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...
117
click to vote
ICLP
2003
Springer
15 years 7 months 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...
132
Voted
JSC
2010
15 years 10 days 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...