Living Book – Deduction, Slicing, and Interaction

Living Book is a system for the management of personalized and scenario-specific teaching material. The main goal of the system is to support active, explorative, and self-determined learning in lectures, tutorials, and self-study. Living Book includes a course on “logic for computer scientists,” with uniform access to various tools such as theorem provers and an interactive tableau editor. It is routinely used in teaching undergraduate courses at our university. This paper describes Living Book, together with its use of theorem-proving technology as a core component in the knowledge management system (KMS) and the use of this new concept in academic teaching. The KMS provides a scenario management component in which teachers may describe those parts of given documents that are relevant in order to achieve a certain learning goal. The task of the KMS is to assemble new documents from a database of elementary units called “slices” (definitions, theorems, and so on) in a scenario-based way (such as, “I want to prepare for an exam and need to learn about resolution”). The computation of such assemblies is carried out by a model-generating theorem prover for first-order logic with a default negation principle. Its input consists of metadata that describes the dependencies between different slices and logic-programming style rules that describe the scenario-specific composition of slices. Additionally, users may assess what units they know or don't know. This information is stored in a user model, which is taken into account to compute a model that specifies the assembly of a personalized document. This paper introduces the e-learning context we are faced with, motivates our choice of logic, and sketches the newly developed calculus used in the KMS. Furthermore, the application and evaluation of Living Book are presented.

[1]  J.C. Principe,et al.  Innovating adaptive and neural systems instruction with interactive electronic books , 2000, Proceedings of the IEEE.

[2]  Jens Woch,et al.  Implementation of a Schema-TAG-Parser , 1999 .

[3]  Jürgen Ebert,et al.  GraX-an interchange format for reengineering tools , 1999, Sixth Working Conference on Reverse Engineering (Cat. No.PR00303).

[4]  Stephan Philippi,et al.  Modelling a concurrent ray-tracing algorithm using object-oriented Petri-Nets , 2001 .

[5]  Elmar Eder Properties of Substitutions and Unifications , 1983, GWAI.

[6]  Volker Riediger,et al.  Folding: an approach to enable program understanding of preprocessed languages , 2001, Proceedings Eighth Working Conference on Reverse Engineering.

[7]  Christoph Wernhard,et al.  System Description : KRHyper , 2003 .

[8]  Peter Baumgartner,et al.  Living Book – An Interactive and Personalized Book ∗ , 2002 .

[9]  Andreas Winter,et al.  Towards a Common Query Language for Reverse Engineering , 2002 .

[10]  Nicolas Peltier,et al.  Pruning the Search Space and Extracting More Models in Tableaux , 1999, Log. J. IGPL.

[11]  Oliver Obst,et al.  Towards a Logical Approach for Soccer Agents Engineering , 2000, RoboCup.

[12]  R. E. Shostak 7th International Conference on Automated Deduction , 1984, Lecture Notes in Computer Science.

[13]  W. Bibel,et al.  Automated deduction : a basis for applications , 1998 .

[14]  Peter Baumgartner,et al.  The Taming of the (X)OR , 2000, Computational Logic.

[15]  J. A. Robinson,et al.  Automatic Deduction with Hyper-Resolution , 1983 .

[16]  Paul Libbrecht,et al.  Knowledge Representation and Management in ACTIVEMATH , 2004, Annals of Mathematics and Artificial Intelligence.

[17]  Ian Horrocks,et al.  Practical Reasoning for Very Expressive Description Logics , 2000, Log. J. IGPL.

[18]  Andy Schürr,et al.  GXL: toward a standard exchange format , 2000, Proceedings Seventh Working Conference on Reverse Engineering.

[19]  Jack Minker,et al.  Bottom-Up Compuation of Perfect Models for Disjunctive Theories , 1995, J. Log. Program..

[20]  Toshiaki Arai,et al.  Multiagent systems specification by UML statecharts aiming at intelligent manufacturing , 2002, AAMAS '02.

[21]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[22]  Christian G. Fermüller,et al.  Hyperresolution and Automated Model Building , 1996, J. Log. Comput..

[23]  Harald Ganzinger,et al.  Perfect Model Semantics for Logic Programs with Equality , 1991, ICLP.

[24]  Jürgen Ebert,et al.  A Formalization of SOCCA , 1999 .

[25]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[26]  Jan Murray Specifying agents with UML in robotic soccer , 2002, AAMAS '02.

[27]  Julita Vassileva,et al.  Dynamic Courseware Generation on the WWW , 1998, Br. J. Educ. Technol..

[28]  Georg Gottlob,et al.  Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models , 2001, Inf. Comput..

[29]  Ulrich Furbach,et al.  Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations , 2001, Handbook of Automated Reasoning.

[30]  Christoph Goller,et al.  SETHEO V3.2: Recent Developments - System Abstract , 1994, CADE.

[31]  Jürgen Dix,et al.  Transformation-based bottom-up computation of the well-founded model , 1996, Theory and Practice of Logic Programming.

[32]  Andreas Winter,et al.  Querying as an enabling technology in software reengineering , 1999, Proceedings of the Third European Conference on Software Maintenance and Reengineering (Cat. No. PR00090).

[33]  Peter Baumgartner,et al.  The Model Evolution Calculus , 2003, CADE.

[34]  François Bry,et al.  SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.

[35]  Margret Groß-Hardt,et al.  Concept based querying of semistructured data , 2002, XSW.

[36]  Paul Libbrecht,et al.  ActiveMath: A Generic and Adaptive Web-Based Learning Environment , 2001 .

[37]  Peter Baumgartner,et al.  First-order logic Davis-Putnam-Logemann-Loveland procedure , 2003 .

[38]  Peter Baumgartner,et al.  Abductive Coreference by Model Construction , 1999 .

[39]  Kurt Lautenbach,et al.  Logical Reasoning and Petri Nets , 2003, ICATPN.

[40]  Oliver Obst,et al.  Spatial Agents Implemented in a Logical Expressible Language , 1999, RoboCup.

[41]  Joseph Douglas Horton,et al.  Merge Path Improvements for Minimal Model Hyper Tableaux , 1999, TABLEAUX.

[42]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[43]  Peter Baumgartner,et al.  Automated Deduction Techniques for the Management of Personalized Documents , 2003, Annals of Mathematics and Artificial Intelligence.

[44]  Peter Baumgartner,et al.  Living Book -- Deduction, Slicing, and Interaction , 2004 .

[45]  Alan R. Dennis,et al.  Rethinking media richness: towards a theory of media synchronicity , 1999, Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences. 1999. HICSS-32. Abstracts and CD-ROM of Full Papers.

[46]  Christoph Weidenbach System Description: Spass Version 1.0.0 , 1999, CADE.

[47]  Georg Gottlob,et al.  A Non-Ground Realization of the Stable and Well-Founded Semantics , 1996, Theor. Comput. Sci..

[48]  Oliver Obst Specifying Rational Agents with Statecharts and Utility Functions , 2001, RoboCup.

[49]  Peter Baumgartner,et al.  FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure , 2000, CADE.

[50]  Peter Baumgartner,et al.  Hyper Tableaux The Next Generation , 1997 .

[51]  Margret Groß-Hardt,et al.  Processing of Concept Based Queries for XML Data , 2002 .

[52]  Chiaki Sakama,et al.  Possible Model Semantics for Disjunctive Databases , 1989, DOOD.

[53]  Manfred Rosendahl,et al.  Specification of Symbols and Implementation of Their Constraints in JKogge , 2000 .

[54]  Konstantinos Sagonas,et al.  An Abstract Machine for Computing the Well-Founded Semantics , 1996, JICSLP.

[55]  Jürgen Dix,et al.  Super logic programs , 2000, TOCL.

[56]  Jürgen Dix,et al.  Relating defeasible and normal logic programming through transformation properties , 2000, Theor. Comput. Sci..

[57]  Kurt Lautenbach,et al.  Reproducibility of the Empty Marking , 2002, ICATPN.

[58]  Ullrich Hustadt,et al.  Hyperresolution for guarded formulae , 2003, J. Symb. Comput..

[59]  Guillermo R. Simari,et al.  lntroducing generalized specificity in logic programming , 2000 .

[60]  Jürgen Dix,et al.  A Framework to Incorporate Non-Monotonic Reasoning Into Constraint Logic Programming , 1998, J. Log. Program..

[61]  Frieder Stolzenburg,et al.  Loop-Detection in Hyper-Tableaux by Powerful Model Generation , 1999, J. Univers. Comput. Sci..

[62]  François Bry,et al.  Perspectives for electronic books in the World Wide Web age , 2002, Electron. Libr..

[63]  Victor W. Marek,et al.  The Logic Programming Paradigm , 1999, Artificial Intelligence.

[64]  Peter Baumgartner,et al.  Hyper Tableau - The Next Generation , 1998, TABLEAUX.

[65]  Andreas Winter,et al.  Exchanging Graphs with GXL , 2001, GD.