294 search results - page 2 / 59 » Relation between Semantic Completeness and Syntax Completene... |
FUIN
2002
13 years 4 months ago
2002
Abstract. In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: trans...
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
A relation between two secrets, known in the literature as nondeducibility, was originally introduced by Sutherland. We extend it to a relation between sets of secrets that we call...
HYBRID
2010
Springer
13 years 3 months ago
2010
Springer
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design...
KBSE
2000
IEEE
13 years 8 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
IJCAI
2003
13 years 6 months ago
2003
We introduce a logical formalism of irreflexivc causal production relations that possesses both a standard monotonic semantics, and a natural nonmonotonic semantics. The formalism...