4513 search results - page 532 / 903 » Logic programming with satisfiability |
133
click to vote
AAAI
2000
15 years 6 months ago
2000
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
128
click to vote
COLING
1996
15 years 6 months ago
1996
In this paper we sketch a decidable inference-based procedure for lexical disambiguation which operates on semantic representations of discourse and conceptual knowledge, In contr...
130
click to vote
IJISEC
2008
15 years 4 months ago
2008
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
128
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
: Since no fusion theory neither rule fully satisfy all needed applications, the author proposes a Unification of Fusion Theories and a combination of fusion rules in solving probl...
143
Voted
ICTAI
2009
IEEE
15 years 2 months ago
2009
IEEE
We address the problem of merging qualitative constraints networks (QCNs). We point out a merging algorithm which computes a consistent QCN representing a global view of the input...