This paper introduces the use of Description Logic as a programming language, giving: a logic with appropriate concept constructors and sentential forms; some example programs; requirements for the results of program execution; a tableau algorithm that provably produces the desired results; principles for discarding sentences once no longer needed so that algorithms with higher time complexity than space complexity can be implemented; a worked example of program execution; and a discussion of outstanding theoretical challenges.