Sciweavers

57 search results - page 3 / 12
» Compiling propositional weighted bases
Sort
View
ECAI
2006
Springer
13 years 9 months ago
Compiling Possibilistic Knowledge Bases
Abstract. Possibilistic knowledge bases gather propositional formulas associated with degrees belonging to a linearly ordered scale. These degrees reflect certainty or priority, de...
Salem Benferhat, Henri Prade
AAAI
2006
13 years 7 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
KI
2007
Springer
14 years 2 days ago
Knowledge Compilation for Description Logics
Abstract. Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to transform a given knowledge base into a special normal form ([MR03],[D...
Ulrich Furbach, Claudia Obermaier
FLAIRS
2009
13 years 3 months ago
A Knowledge Compilation Technique for ALC Tboxes
Knowledge compilation is a common technique for propositional logic knowledge bases. A given knowledge base is transformed into a normal form, for which queries can be answered ef...
Ulrich Furbach, Heiko Günther, Claudia Oberma...
ITS
2004
Springer
153views Multimedia» more  ITS 2004»
13 years 11 months ago
Modeling Students' Reasoning About Qualitative Physics: Heuristics for Abductive Proof Search
Abstract. We describe a theorem prover that is used in the Why2Atlas tutoring system for the purposes of evaluating the correctness of a student’s essay and for guiding feedback ...
Maxim Makatchev, Pamela W. Jordan, Kurt VanLehn