330 search results - page 5 / 66 » Algorithms for Propositional Model Counting |
IJCAI
1997
14 years 10 months ago
1997
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
101
click to vote
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
Estimating the number of people in a crowded environment is a central task in civilian surveillance. Most vision-based counting techniques depend on detecting individuals in order...
TABLEAUX
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
IJAR
2008
14 years 9 months ago
2008
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider g...
ECAI
2010
Springer
14 years 6 months ago
2010
Springer
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...