181 search results - page 36 / 37 » On the Completeness of Propositional Hoare Logic |
CAV
2009
Springer
14 years 29 days ago
2009
Springer
tic modalities for correctness [16]. The release described in this abstract is a complete rebuild of a preliminary experimental checker [14]. The model input language includes vari...
AAAI
2006
13 years 10 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
CORR
1998
Springer
13 years 8 months ago
1998
Springer
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
IJSI
2010
13 years 7 months ago
2010
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
FPGA
2005
ACM
14 years 2 months ago
2005
ACM
Creating a new FPGA is a challenging undertaking because of the significant effort that must be spent on circuit design, layout and verification. It currently takes approximately ...