29 search results - page 4 / 6 » A Finite Basis for Failure Semantics |
IJCAI
1993
14 years 11 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
137
click to vote
AGTIVE
2007
Springer
15 years 1 months ago
2007
Springer
On the basis of a case-study, we demonstrate the usefulness of topology invariants for model-driven systems development. Considering a graph grammar semantics for a relevant fragme...
119
click to vote
AMAI
1999
Springer
14 years 9 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
79
Voted
SCCC
1997
IEEE
15 years 1 months ago
1997
IEEE
Processing on the Amoeba distributed operating system is not fault-tolerant. The only concern of its processing service is to perform load balancing on the existing processors, tr...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
As the data and ontology layers of the Semantic Web stack have achieved a certain level of maturity in standard recommendations such as RDF and OWL, the current focus lies on two ...