472 search results - page 21 / 95 » Limiting Negations in Formulas |
ECSQARU
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of cla...
TASLP
2002
13 years 10 months ago
2002
In many (audio) processing algorithms, involving manipulation of discrete-time signals, the performance can vary strongly over the repertoire that is used. This may be the case whe...
SAT
2005
Springer
14 years 3 months ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
ADBIS
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. Traditionally, the investment funds market exploits analysis and design concepts based on the procedural programming approach. We propose a set of analysis patterns which...
JSYML
2006
13 years 10 months ago
2006
We define a notion of realizability, based on a new assignment of formulas, which does not care for precise witnesses of existential statements, but only for bounds for them. The ...