11 search results - page 2 / 3 » Prime Implicate Normal Form for ALC Concepts |
KI
2007
Springer
14 years 12 days ago
2007
Springer
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...
IDEAS
2002
IEEE
13 years 11 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
LPAR
1994
Springer
13 years 10 months ago
1994
Springer
The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potent...
JSAT
2006
13 years 6 months ago
2006
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
LPAR
2005
Springer
13 years 11 months ago
2005
Springer
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA), and we introduce a local optimization criterion fo...