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
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Symbolic model checking of process networks using interval diagram techniques
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Decomposable negation normal form
Journal of the ACM (JACM)
FA Minimisation Heuristics for a Class of Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Transformations between Signed and Classical Clause Logic
ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
Algorithm 852: RealPaver: an interval solver using constraint satisfaction techniques
ACM Transactions on Mathematical Software (TOMS)
A survey on knowledge compilation
AI Communications
Incremental algorithms for approximate compilation
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Journal of Artificial Intelligence Research
DPLL with a trace: from SAT to knowledge compilation
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Decision diagrams for the computation of semiring valuations
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Constraint-Based Controller Synthesis in Non-Deterministic and Partially Observable Domains
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Solving constraint satisfaction problems using finite state automata
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Representing CSPs with set-labeled diagrams: a compilation map
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Towards a knowledge compilation map for heterogeneous representation languages
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.01 |
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notion of interval automaton (IA), adapted to the compilation of problems involving both discrete and continuous variables, and especially of decision policies and transition tables, in the purpose of controlling autonomous systems. Interval automata can be seen as a generalization of binary decision diagrams (BDDs) insofar as they are rooted DAGs with variable-labelled nodes, with the differences that interval automata are non-deterministic structures whose edges are labelled with closed intervals and whose nodes can have a multiplicity greater than two. This paper studies the complexity of the queries and transformations classically considered when examining a new compilation language. We show that a particular subset of interval automata, the focusing ones (FIAs), have theoretical capabilities very close to those of DNNFs; they notably support in polytime the main operations needed to handle decision policies online. Experimental results are presented in order to support these claims.