Translation of Decision Tables
ACM Computing Surveys (CSUR)
The synthetic approach to decision table conversion
Communications of the ACM
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Three approaches to heuristic search in networks
Journal of the ACM (JACM)
AND/OR graph heuristic search methods
Journal of the ACM (JACM)
School time table scheduling in Prolog
ACM SIGART Bulletin
Efficient Branch-and-Bound Algorithms on a Two-Level Memory System
IEEE Transactions on Software Engineering
Optimal Partitioning for Classification and Regression Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Developing legal knowledge based systems using decision tables
ICAIL '93 Proceedings of the 4th international conference on Artificial intelligence and law
Proactive password checking with decision trees
Proceedings of the 4th ACM conference on Computer and communications security
High dictionary compression for proactive password checking
ACM Transactions on Information and System Security (TISSEC)
Heuristic search in cyclic AND/OR graphs
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Dynamic Programming as Graph Searching: An Algebraic Approach
Journal of the ACM (JACM)
Random Trees and the Analysis of Branch and Bound Procedures
Journal of the ACM (JACM)
Best first search in and/or graphs
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
ACM Computing Surveys (CSUR)
The Activity of a Variable and Its Relation to Decision Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
IEEE Transactions on Knowledge and Data Engineering
Sequential Decision Models for Expert System Optimization
IEEE Transactions on Knowledge and Data Engineering
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics
Integrating knowledge in problem solving search procedures
ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
VLSI floorplan generation and area optimization using AND-OR graph search
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
A machine translation system for foreign news in satellite broadcasting
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Strong planning under partial observability
Artificial Intelligence
Propagating multitrust within trust networks
Proceedings of the 2008 ACM symposium on Applied computing
Concurrency, Graphs and Models
SCLP for Trust Propagation in Small-World Networks
Recent Advances in Constraints
The assignment of computational tasks among processors in a distributed system
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Generating rules from examples
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Strong planning under partial observability
Artificial Intelligence
Unicast and multicast QoS routing with soft-constraint logic programming
ACM Transactions on Computational Logic (TOCL)
Optimizing the predictive value of diagnostic decision rules
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
Optimizing the predictive value of diagnostic decision rules
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
Solving uncertain markov decision problems: an interval-based method
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Engineering Applications of Artificial Intelligence
A heuristically 'optimal' knowledge base organization technique
Automatica (Journal of IFAC)
Algorithms for generating ordered solutions for explicit and/or structures
Journal of Artificial Intelligence Research
Robotics and Autonomous Systems
Survey on assembly sequencing: a combinatorial and geometrical perspective
Journal of Intelligent Manufacturing
| Hi-index | 48.22 |
Optimal decision table conversion has been tackled in the literature using two approaches, dynamic programming and branch-and-bound. The former technique is quite effective, but its time and space requirements are independent of how “easy” the given table is. Furthermore, it cannot be used to produce good, quasioptimal solutions. The branch-and-bound technique uses a good heuristic to direct the search, but is cluttered up by an enormous search space, since the number of solutions increases with the number of test variables according to a double exponential. In this paper we suggest a heuristically guided top-down search algorithm which, like dynamic programming, recognizes identical subproblems but which can be used to find both optimal and quasioptimal solutions. The heuristic search method introduced in this paper combines the positive aspects of the above two techniques. Compressed tables with a large number of variables can be handled without deriving expanded tables first.