392 search results - page 49 / 79 » Negation as Partial Failure |
FAC
2008
13 years 7 months ago
2008
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
IJFCS
2006
13 years 7 months ago
2006
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
JAPLL
2007
13 years 7 months ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
TCAD
1998
13 years 7 months ago
1998
—A probabilistic diagnosis algorithm is presented for constant degree structures. The performance of the algorithm is analyzed under a negative binomial failure distribution to a...
TON
1998
13 years 7 months ago
1998
Abstract— Group communication services have been successfully used to construct applications with high availability, dependability, and real-time responsiveness requirements. Flo...