903 search results - page 89 / 181 » Completeness Results for Memory Logics |
MTV
2007
IEEE
14 years 3 months ago
2007
IEEE
The widening gap between CPU complexity and verification capability is becoming increasingly more salient. It is impossible to completely verify the functionality of a modern mic...
ICLP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
SIGECOM
2003
ACM
14 years 2 months ago
2003
ACM
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying o...
OPODIS
2003
13 years 10 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
ICLP
2010
Springer
14 years 22 days ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...