827 search results - page 120 / 166 » Proof-Theoretic Soundness and Completeness |
131
click to vote
LOPSTR
2007
Springer
15 years 6 months ago
2007
Springer
CooML is an object-oriented modeling language where specifications are theories in a constructive logic designed to handle incomplete information. In this logic we view snapshots ...
98
Voted
PPDP
2007
Springer
15 years 6 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
SARA
2007
Springer
15 years 6 months ago
2007
Springer
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
109
click to vote
TARK
2007
Springer
15 years 6 months ago
2007
Springer
In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of so...
124
Voted
COMSWARE
2006
IEEE
15 years 6 months ago
2006
IEEE
Many of the bugs in distributed software modules are security vulnerabilities, the most common and also the most exploited of which are buffer overflows and they typically arise in...