Computing with default logic

Abstract

Default logic was proposed by Reiter as a knowledge representation tool. In this paper, we present our work on the Default Reasoning System, DeReS, the first comprehensive and optimized implementation of default logic. While knowledge representation remains the main application area for default logic, as a source of large-scale problems needed for experimentation and as a source of intuitions needed for a systematic methodology of encoding problems as default theories we use here the domain of combinatorial problems.To experimentally study the performance of DeReS we developed a benchmarking system, the TheoryBase. The TheoryBase is designed to support experimental investigations of nonmonotonic reasoning systems based on the language of default logic or logic programming. It allows the user to create parameterized collections of default theories having similar properties and growing sizes and, consequently, to study the asymptotic performance of nonmonotonic systems under investigation. Each theory generated by the TheoryBase has a unique identifier, which allows for concise descriptions of test cases used in experiments and, thus, facilitates comparative studies. We describe the TheoryBase in this paper and report on our experimental studies of DeReS performance based on test cases generated by the TheoryBase.