Automated deduction techniques for the management of personalized documents

Annals of Mathematics and Artificial Intelligence

Volumn 38, Issue 1-3, 2003, Pages 211-228

  Baumgartner, Peter ^a   Furbach, Ulrich ^a  

^a Universität Koblenz Landau ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037256742     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022976016809     Document Type: Conference Paper

References (26)

1. P. Baumgartner, Hyper tableaux - the next generation, in: Automated Reasoning with Analytic Tableaux and Related Methods, ed. H. de Swaart, Lecture Notes in Artificial Intelligence, Vol. 1397 (Springer, Berlin, 1998) pp. 60-76.
2. P. Baumgartner, FDPLL - a first-order Davis-Putnam-Logeman-Loveland procedure, in: CADE-17 - The 17th International Conference on Automated Deduction, ed. D. McAllester, Lecture Notes in Artificial Intelligence, Vol. 1831 (Springer, Berlin, 2000) pp. 200-219.
3. P. Baumgartner, U. Furbach and I. Niemelä, Hyper tableaux, in: Proc. JELIA 96 (Springer, Berlin, 1996).
4. S.-E. Bornscheuer, Rational models of normal logic programs, in: KI-96: Advances in Artificial Intelligence, ed. S.H. Günther Görz, Lecture Notes in Artificial Intelligence, Vol. 1137 (Springer, Berlin, 1996) pp. 1-4.
5. W.F. Clocksin and C.S. Melish, Programming in PROLOG (Springer, Berlin, 1981).
6. I. Dahn and H. Wolter, Analysis Individuell (Springer, Berlin, 2000).
7. J. Dix, U. Furbach and I. Niemelä, Nonmonotonic reasoning: towards efficient calculi and implementations, in: Handbook of Automated Reasoning, eds. A. Voronkov and A. Robinson (Elsevier Science, 2001) pp. 1121-1234.
8. J. Dix and F. Stolzenburg, A framework to incorporate non-monotonic reasoning into constraint logic programming, Journal of Logic Programming 37(1-3), Special Issue on Constraint Logic Programming, eds. K. Marriott and P.J. Stuckey (1998) 47-76.
9. T. Eiter, J. Lu and V.S. Subrahmanian, Computing non-ground representations of stable models, in: Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-97), eds. J. Dix, U. Furbach and A. Nerode (Springer, Berlin, 1997) pp. 198-217.
10. C. Fermüller and A. Leitsch, Hyperresolution and automated model building, Journal of Logic and Computation 6(2) (1996) 173-230.
11. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Proceedings of the 5th International Conference on Logic Programming, Seattle, eds. R. Kowalski and K. Bowen (1988) pp. 1070-1080.
12. C. Goller, R. Letz, K. Mayr and J. Schumann, SETHEO V3.2: Recent developments - system abstract, in: Automated Deduction - CADE 12, Nancy, France, ed. A. Bundy (Springer, Berlin, 1994) pp. 778-782.
13. G. Gottlob, S. Marcus, A. Nerode, G. Salzer and V.S. Subrahmanian, A non-ground realization of the stable and well-founded semantics, Theoretical Computer Science 166(1-2) (1996) 221-262.
14. P. Graf, ACID user manual - Version 1.0, Technical Report MPI-I-94-DRAFT, Max-Planck-Institut, Saarbrücken, Germany (1994).
15. I. Horrocks, U. Sattler and S. Tobies, Practical reasoning for very expressive description logics, Logic Journal of the IGPL 8(3) (2000) 239-263.
16. R. Letz, Clausal tableaux, in: Automated Deduction. A Basis for Applications, eds. W. Bibel and P.H. Schmitt (Kluwer Academic, 1998).
17. R. Manthey and F. Bry, SATCHMO: a theorem prover implemented in Prolog, in: Proceedings of the 9th Conference on Automated Deduction, Argonne, Illinois, May 1988, eds. E. Lusk and R. Overbeek, Lecture Notes in Computer Science, Vol. 310 (Springer, Berlin, 1988) pp. 415-434.
18. I. Niemelä and P. Simons, Efficient implementation of the well-founded and stable model semantics, in: Proceedings of the Joint International Conference and Symposium on Logic Programming, Bonn, Germany (The MIT Press, Cambridge, MA, 1996).
19. N. Peltier, Pruning the search space and extracting more models in tableaux, Logic Journal of the IGPL 7(2) (1999) 217-251.
20. J.A. Robinson, Automated deduction with hyper-resolution, International Journal of Computational Mathematics 1 (1965) 227-234.
21. K. Sagonas, T. Swift and D.S. Warren, An abstract machine for computing the well-founded semantics, Journal of Logic Programming (2000), to appear.
22. C. Sakama, Possible model semantics for disjunctive databases, in: Proceedings First International Conference on Deductive and Object-Oriented Databases (DOOD-89), eds. W. Kim, J.-M. Nicholas and S. Nishio (Elsevier Science/North-Holland, Amsterdam, 1990) pp. 337-351.
23. M. Schmidt-Schauß and G. Smolka, Attributive concept descriptions with complements, Artificial Intelligence 48(1) (1991), 1-26.
24. F. Stolzenburg, Loop-detection in hyper-tableaux by powerful model generation, Journal of Universal Computer Science 5(3), Special Issue on Integration of Deduction Systems, eds. R. Hähnle, W. Menzel, P.H. Schmitt and W. Reif (1999) 135-155.
25. A. Van Gelder, K.A. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, Journal of the ACM 38 (1991) 620-650.
26. C. Weidenbach, B. Afshordel, U. Brahm, C. Cohrs, T. Engel, E. Keen, C. Theobalt and D. Topić, System description: SPASS Version 1.0.0, in: CADE-16 - The 16th International Conference on Automated Deduction, Trento, Italy, ed. H. Ganzinger, Lecture Notes in Artificial Intelligence, Vol. 1632 (Springer, Berlin, 1999) pp. 378-382.