Knowledge Compilation Meets Database Theory: Compiling Queries to Decision Diagrams
نویسندگان
چکیده
منابع مشابه
Symmetry-Driven Decision Diagrams for Knowledge Compilation
In this paper, symmetries are exploited for achieving significant space savings in a knowledge compilation perspective. More precisely, the languages FBDD and DDG of decision diagrams are extended to the languages Sym-FBDDX,Y and Sym-DDGX,Y of symmetry-driven decision diagrams, where X is a set of ”symmetry-free” variables and Y is a set of ”top” variables. Both the time efficiency and the spac...
متن کاملA Knowledge Compilation Map for Ordered Real-Valued Decision Diagrams
Valued decision diagrams (VDDs) are data structures that represent functions mapping variable-value assignments to non-negative real numbers. They prove useful to compile cost functions, utility functions, or probability distributions. While the complexity of some queries (notably optimization) and transformations (notably conditioning) on VDD languages has been known for some time, there remai...
متن کاملKnowledge Compilation Meets Communication Complexity
Choosing a language for knowledge representation and reasoning involves a trade-off between two competing desiderata: succinctness (the encoding should be small) and tractability (the language should support efficient reasoning algorithms). The area of knowledge compilation is devoted to the systematic study of representation languages along these two dimensions—in particular, it aims to determ...
متن کاملCompiling Database Queries into Machine Code
On modern servers the working set of database management systems becomes more and more main memory resident. Slow disk accesses are largely avoided, and thus the in-memory processing speed of databases becomes an important factor. One very attractive approach for fast query processing is justin-time compilation of incoming queries. By producing machine code at runtime we avoid the overhead of t...
متن کاملCompiling Probabilistic Graphical Models Using Sentential Decision Diagrams
Knowledge compilation is a powerful approach to exact inference in probabilistic graphical models, which is able to effectively exploit determinism and context-specific independence, allowing it to scale to highly connected models that are otherwise infeasible using more traditional methods (based on treewidth alone). Previous approaches were based on performing two steps: encode a model into C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2012
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-012-9392-5