330 search results - page 19 / 66 » Algorithms for Propositional Model Counting |
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluat...
AIPS
2008
14 years 11 months ago
2008
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...
SI3D
1999
ACM
15 years 1 months ago
1999
ACM
Visibility computation and level of detail modeling are two important components of efficient scenerendering algorithms. Both aim to lessen the graphics load by lowering polygon c...
101
click to vote
COCO
1993
Springer
15 years 1 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
ATVA
2008
Springer
14 years 11 months ago
2008
Springer
Multi-valued Model Checking is an extension of classical, two-valued model checking with multi-valued logic. Multi-valuedness has been proved useful in expressing additional inform...