187 search results - page 20 / 38 » On Expressive and Model Checking Power of Propositional Prog... |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tab...
WOLLIC
2010
Springer
14 years 22 days ago
2010
Springer
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
JASIS
2000
13 years 7 months ago
2000
In the logical approach to information retrieval (IR), retrieval is considered as uncertain inference. Whereas classical IR models are based on propositional logic, we combine Dat...
SLP
1993
13 years 9 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
ECSQARU
1997
Springer
13 years 12 months ago
1997
Springer
Abstract. Today, different formalisms exist to solve reasoning problems under uncertainty. For most of the known formalisms, corresponding computer implementations are available. ...