Künstliche Intelligenz
Institut für Informatik / Universität Koblenz
Baumgartner, Peter; Furbach, Ulrich
Automated Deduction Techniques for the Management of Personalized DocumentsAnnals of mathematics and artificial intelligence. AMAI. Bd. 38. H. 1. Amsterdam: Baltzer 2003 S. 211 - 228
Kushmerick, Nicholas; Thomas, Bernd
Part One - Agent-Based Information Systems - Adaptive Information Extraction: Core Technologies for Information AgentsLecture notes in computer science. Bd. 2586. Berlin: Springer 2003 S. 79 - 103
Baumgartner, P.
Knowledge Management Systemhttp://www.uni-koblenz.de/~peter/KMS-deliverable.pdf. 2001
Beuster, G.; Thomas, B.; Wolff, C.
MIA - An Ubiquitous Multi-Agent Web Information Systemhttp://www.icsc-naiso.org/ ICSC Symposium on Intelligent Systems & Application - MAMA 2000;. NAISO Academic Press 2000
Baumgartner, Peter
Session 4: FDPLL - A First Order Davis-Putnam-Longeman-Loveland ProcedureLecture notes in computer science. Bd. 1831. Berlin: Springer 2000 S. 200 - 219
Beuster, G.; Thomas, B.; Wolff, C.
Ubiquitous Web Information AgentsEuropean Conference on Aritifical Intelligence - Workshop on Artificial Intelligence In Mobile Systems. 2000
Stolzenburg, Frieder
An Algorithm for General Set Unification and Its ComplexityJournal of automated reasoning. Bd. 22. H. 1. Dordrecht [u.a.]: Springer 1999 S. 45 - 64
Stolzenburg, F.; Hähnle, H.; Menzel, W. et al.
Loop-Detection in Hyper-Tableaux by Powerful Model GenerationJournal of Universal Computer Science. Bd. Journal of Universal Computer Science. Berlin, Heidelberg, New York: Springer 1999 S. 135-155
Stolzenburg, Frieder
A flexible System for Constraint Disjunctive Logic ProgrammingKünstliche Intelligenz. KI ; Forschung, Entwicklung, Erfahrungen ; Organ des Fachbereichs 1 Künstliche Intelligenz der Gesellschaft für Informatik e.V., GI. Bd. 12. H. 2. Bremen: Böttcher IT-Verl. 1998 S. 73 - 78
Baumgartner, P.; Furbach, U.; Bibel, W. et al.
Chapter I.3: Variants of Clausal TableauxBibel, W.; Schmitt, P. H. (Hrsg). Automated Deduction. A basis for applications. Kluwer Academic Publishers 1998 S. 73-102
Baumgartner, P.; Petermann, U.; Bibel, W. et al.
Chapter II.6: Theory ReasoningBibel, W.; Schmitt, P. H. (Hrsg). Automated Deduction. A basis for applications. Kluwer Academic Publishers 1998 S. 191-224
Dix, J.; Stolzenburg, F.
Section 1: Theory - A framework to incorporate non-monotonic reasoning into constraint logic programmingThe journal of logic programming. Bd. 37. H. 1. New York, NY: North-Holland 1998 S. 47 - 76
Brass, Stefan; Dix, Jürgen; Przymusinski, Teodor C.
Super logic programsKoblenz-Landau: Univ., Inst, für Informatik 1998 0 S. (Fachberichte Informatik ; 17/98)
Baumgartner, P.
Theory Reasoning in Connection CalculiLecture Notes in Artificial Intelligence. Springer 1998
Baumgartner, Peter; Aravindan, C.; Baumgartner, P. et al.
A Rational and Efficient Algorithm for View Deletion in DatabasesJ. Maluszynski (Hrsg). Logic Programming - Proceedings of the 1997 International Symposium. The MIT Press 1997
Baumgartner, P.; Furbach, U.; J. Maluszynski, J. Maluszynski
Calculi for Disjunctive Logic ProgrammingJ. Maluszynski (Hrsg). Logic Programming - Proceedings of the 1997 International Symposium. The MIT Press 1997
Dix, J.; Stolzenburg, F.
Computation of Non-Ground Disjunctive Well-Founded Semantics with Constraint Logic ProgrammingLecture notes in computer science. Bd. 1216. Berlin: Springer 1997
Baumgartner, P.; Furbach, U.; Stolzenburg, F.
Computing answers with model eliminationArtificial intelligence. an international journal. Bd. 90. H. 1. Amsterdam: Elsevier 1997 S. 135 - 176
Stolzenburg, Frieder; Höhne, Stephan; Koch, Ulrich et al.
Constraint logic programming for computational linguisticsLecture notes in computer science. Bd. 1328. Berlin: Springer 1997 S. 406 - 425
Aravindan, C.; Dix, J.; Niemelä, I.
DisLoP: A research project on Disjunctive Logic ProgrammingAI communications. AICOM ; the European journal on artificial intelligence. Bd. 10. H. 3. Amsterdam. 1997 S. 151 - 166
Brewka, Gerhard; Dix, Jürgen; Konolige, Kurt
Nonmonotonic reasoning : an overviewStanford, Calif.: CSLI Publ. 1997 0 S. (CSLI lecture notes ; 73)
Baumgartner, Peter; P. Baumgartner, P.; Furbach, U.
Refinements for Restart Model EliminationProceedings of the International Workshop on First Order Theorem Proving (FTP 97). 1997
Aravindan, C.; Görz, G.; Hölldobler, S.
"DisLoP: A disjunctive logic programming system based on PROTEIN theorem proverGörz, G.; Hölldobler, S. (Hrsg). Proceedings of KI '96. Springer-Verlag 1996 S. 19-23
Aravindan, C.; Alfares, J.J.; Pereira, E.
An abductive framework for negation in disjunctive logic programmingAlfares, J.J.; Pereira, L.M., Orlowska, E. (Hrsg). Proceedings of Joint European workshop on Logics in AI. Springer-Verlag 1996 S. 252-267
Dix, Jürgen
Disjunctive logic programming and databasesSaarbrücken: Geschäftsstelle Schloss Dagstuhl 1996 27 S. (Dagstuhl-Seminar-Report ; 150 = 9627)
Baumgartner, P.; Beckert, Bernhard; Kühn, Michael et al.
Extending Hyper Tableaux with Rigid E-UnificationPrasser, K. (Hrsg). Workshop Deduktion, 20. Jahrestagung für künstliche Intelligenz, Zusammenfassungen. Fakultät Informatik, D-01062 Dresden: Technisches Universität Dresden 1996
Baumgartner, P.; Furbach, U.; Niemelä, Ilkka
Hyper TableauxProceedings Joint European workshop on Logics in AI '96. Springer 1996
Furbach, U.; Baumgartner, Peter
Hyper Tableaux and Disjunctive Logic ProgrammingICLP Workshop on Deductive Databases and Logic Programming. GMD 1996
Baumgartner, Peter
Linear and Unit-Resulting Refutations for Horn TheoriesJournal of automated reasoning. Bd. 16. H. 3. Dordrecht [u.a.]: Springer 1996 S. 241 - 320
Chandrabose, Aravindan; Baumgartner, Peter; Dix, Jürgen et al.
On Merging Theorem Proving and Logic Programming ParadigmsMaher, M. (Hrsg). Proceedings of the Joint International Conference and Symposiums on Logic Programming, Bad Honnef. Cambridge, MA, London, England: MIT Press 1996 S. 546
Baumgartner, P.
Theory Reasoning in Connection Calculi and the Linearizing Completion Approach1996
Baumgartner, Peter; Brüning, Stefan
A disjunctive positive refinement of model elimination and its application to subsumption deletionKoblenz-Landau: Univ., Inst. f. Informatik 1995 48 S. (Fachberichte Informatik ; 6/95)
Stolzenburg, Frieder; Thomas, Bernd
Analysing rule sets for the calculation of banking fees by a theorem prover with constraintsKoblenz-Landau: Univ., Inst. f. Informatik 1995 15 S. (Fachberichte Informatik ; 14/95)
Baumgartner, Peter
Deduktion und Logisches ProgrammierenKoblenz-Landau: Univ., Inst. f. Informatik 1995 11 S. (Fachberichte Informatik ; 17/95)
Dix, Jürgen; Furbach, Ulrich; Furbach, Ulrich
Logisches Programmieren mit Negation und DisjunktionKoblenz-Landau: Univ., Inst. f. Informatik 1995 15 S. ([Fachberichte Informatik ; 21/95)
Stolzenburg, Frieder
Membership-constraints and complexity in logic programming with setsKoblenz-Landau: Univ., Inst. f. Informatik 1995 15 S. (Fachberichte Informatik ; 13/95)
Dix, Jürgen; Gottlob, Georg; Marek, V. Wiktor
Reducing disjunctive to non-disjunctive semantics by shift-operationsKoblenz-Landau: Univ., Inst. f. Informatik 1995 17 S. (Fachberichte Informatik ; 18/95)
Baumgartner, P.; Furbach, U.; Thomas, B.
Model based deduction for knowledge representation17. WLP - Workshop Logische Programmierung.