57 search results - page 2 / 12 » Compiling propositional weighted bases |
LPNMR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
IJAR
2006
13 years 5 months ago
2006
We describe in this paper a system for exact inference with relational Bayesian networks as defined in the publicly available Primula tool. The system is based on compiling propos...
IJCAI
1997
13 years 6 months ago
1997
Tractable covers are introduced as a new ap proach to equivalence-preserving compilation of propositional knowledge bases. First, a gen eral framework is presented. Then, two ...
JAIR
2007
13 years 5 months ago
2007
This paper is concerned with a class of algorithms that perform exhaustive search on propositional knowledge bases. We show that each of these algorithms defines and generates a ...
LPNMR
2005
Springer
13 years 10 months ago
2005
Springer
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case...