257 search results - page 29 / 52 » The Complexity of Model Checking for Propositional Default L... |
AAAI
2007
13 years 10 months ago
2007
In probabilistic reasoning, the problems of existence and identity are important to many different queries; for example, the probability that something that fits some description...
ICLP
2001
Springer
14 years 2 hour ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
SPIN
2007
Springer
14 years 1 months ago
2007
Springer
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
ENTCS
2008
13 years 7 months ago
2008
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...
WWW
2002
ACM
14 years 8 months ago
2002
ACM
HTML documents composed of frames can be difficult to write correctly. We demonstrate a technique that can be used by authors manually creating HTML documents (or by document edit...