7988 search results - page 67 / 1598 » A Useful Undecidable Theory |
COORDINATION
2010
Springer
13 years 9 months ago
2010
Springer
In the context of service-oriented computing, behavioural contracts are descriptions of the message-passing behaviour of services. They can be used to check properties of service c...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
IPL
2008
13 years 9 months ago
2008
It is a truism that for a machine to have a useful access to memory or workspace, it must "know" where its input ends and its working memory begins. Most machine models ...
JAR
2006
13 years 8 months ago
2006
We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we sho...
IANDC
2007
13 years 8 months ago
2007
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...