129 search results - page 20 / 26 » Compiling Possibilistic Knowledge Bases |
AAAI
2000
13 years 10 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 ...
JELIA
2010
Springer
13 years 7 months ago
2010
Springer
Multi-Context Systems (MCS) are formalisms that enable the interlinkage of single knowledge bases, called contexts, via bridge rules. Recently, the evaluation of heterogeneous, no...
ECIR
2008
Springer
13 years 10 months ago
2008
Springer
More and more documents on the World Wide Web are based on templates. On a technical level this causes those documents to have a quite similar source code and DOM tree structure. G...
SEMCO
2009
IEEE
14 years 3 months ago
2009
IEEE
—We present LAIR: A domain-specific language that enables users to specify actions to be taken upon meeting specific semantic frames in a text, in particular to rephrase and re...
PLDI
2003
ACM
14 years 1 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...