330 search results - page 26 / 66 » Algorithms for Propositional Model Counting |
IJAR
2010
14 years 8 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
100
click to vote
CSCLP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
ESA
2010
Springer
14 years 10 months ago
2010
Springer
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
ECCC
2007
14 years 9 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
One approach to moderating the expected behaviour of agents in open societies is the use of explicit languages for defining norms, conditional commitments and/or social expectation...