Sciweavers

57 search results - page 4 / 12
» Compiling propositional weighted bases
Sort
View
AAAI
2008
13 years 9 months ago
Extending the Knowledge Compilation Map: Krom, Horn, Affine and Beyond
We extend the knowledge compilation map introduced by Darwiche and Marquis with three influential propositional fragments, the Krom CNF one (also known as the bijunctive fragment)...
Hélène Fargier, Pierre Marquis
FSMNLP
2005
Springer
14 years 17 days ago
TAGH: A Complete Morphology for German Based on Weighted Finite State Automata
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...
Alexander Geyken, Thomas Hanneforth
CP
2003
Springer
14 years 8 days ago
Solving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
Simon de Givry, Javier Larrosa, Pedro Meseguer, Th...
AIED
2005
Springer
14 years 18 days ago
How to Qualitatively + Quantitatively Assess Concepts Maps: the case of COMPASS
This paper presents a scheme for the quantitative and qualitative assessment of concept maps in the context of a web-based adaptive concept map assessment tool, referred to as COMP...
Evangelia Gouli, Agoritsa Gogoulou, Kyparisia A. P...
AAAI
2000
13 years 8 months ago
The Complexity of Restricted Consequence Finding and Abduction
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
Alvaro del Val