Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Translating default logic into standard autoepistemic logic
Journal of the ACM (JACM)
Algebric Decision Diagrams and Their Applications
Formal Methods in System Design
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Knowledge Representation and Reasoning
Knowledge Representation and Reasoning
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Knowledge Representation
Handbook of Knowledge Representation
Extending the knowledge compilation map: Krom, Horn, affine and beyond
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
On valued negation normal form formulas
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Knowledge compilation properties of trees-of-BDDs, revisited
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Knowledge Compilation Using Interval Automata and Applications to Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Compiling CSPs: A Complexity Map of (Non-Deterministic) Multivalued Decision Diagrams
ICTAI '12 Proceedings of the 2012 IEEE 24th International Conference on Tools with Artificial Intelligence - Volume 01
| Hi-index | 0.00 |
The knowledge compilation map introduced by Darwiche and Marquis takes advantage of a number of concepts (mainly queries, transformations, expressiveness, and succinctness) to compare the relative adequacy of representation languages to some AI problems. However, the framework is limited to the comparison of languages that are interpreted in a homogeneous way (formulæ are interpreted as Boolean functions). This prevents one from comparing, on a formal basis, languages that are close in essence, such as OBDD, MDD, and ADD. To fill the gap, we present a generalized framework into which comparing formally heterogeneous representation languages becomes feasible. In particular, we explain how the key notions of queries and transformations, expressiveness, and succinctness can be lifted to the generalized setting.