Library
. Querying Formal Contexts with Answer Set Programs. In 14th International Conference on Conceptual Structures, ICCS 2006. Aalborg, Denmark; 2006. p. 260-273. 
(370.44 KB)
(370.44 KB). A Semantic Future for AI. IEEE Intelligent Systems. 2006 ;:8-9. (80.16 KB)
(80.16 KB). Visual Ontology Modeling for Electronic Markets. In 2006. (2.98 MB)
(2.98 MB). Automatisiertes Schließen mit formalen Begriffen: Mathematische Grundlagen. In 2005. 
(0 bytes)
(0 bytes). Bridging the Paradigm Gap with Rules for OWL. In W3C Workshop on Rule Languages for Interoperability; 2005. (0 bytes)
(0 bytes). Computing First-Order Logic Programs by Fibring Artificial Neural Networks. In Eighteenth International Florida Artificial Intelligence Research Symposium Conference. Clearwater Beach, Florida, USA; 2005. (93.97 KB)
(93.97 KB). Description Logic Programs: A Practical Choice For the Modelling of Ontologies. In 1st Workshop on Formal Ontologies meet Meet Industry, FOMI'05; 2005. (0 bytes)
(0 bytes). Dimensions of Neural-Symbolic Integration - A Structured Survey. In 2005. (0 bytes)
(0 bytes). DLP Isn't So Bad After All. In 2005. (88.28 KB)
(88.28 KB). DLP Isn't So Bad After All. In DLP Isn't So Bad After All. 2005.
. Faster OWL Using Split Programs. In 2005. (0 bytes)
(0 bytes). Level Mapping Characterizations of Selector-Generated Models for Logic Programs. In 19th Workshop on (Constraint) Logic Programming; 2005. (0 bytes)
(0 bytes). Modeling Fuzzy Rules with Description Logics. In 2005. (186.61 KB)
(186.61 KB). Morphisms in Context. In 13th International Conference on Conceptual Structures, ICCS '05. Kassel, Germany; 2005. p. 223-237. (159.48 KB)
(159.48 KB). Ontology Learning as a Use Case for Neural-Symbolic Integration. In Ontology Learning as a Use Case for Neural-Symbolic Integration. 2005.
. Resolution-based approximate reasoning for OWL DL. In ISWC2005. Galway, Ireland; 2005. p. 383-397. (182 KB)
(182 KB). Semantic Management of Web Services using the Core Ontology of Services. In W3C Workshop on Frameworks for Semantics in Web Services; 2005. (0 bytes)
(0 bytes). The Semantic Web in One Day. IEEE Intelligent Systems. 2005 ;:85-87. (133.79 KB)
(133.79 KB). Towards a Systematic Account of Different Semantics for Logic Programs. Journal of Logic and Computation. 2005 ;:391-404. (224.54 KB)
(224.54 KB). A uniform approach to logic programming semantics. Theory and Practice of Logic Programming. 2005 ;:123-159. (326.6 KB)
(326.6 KB). The Well-Supported Semantics for Multidimensional Dynamic Logic Programs. In 8th International Conference, LPNMR 2005. Diamante, Italy; 2005. p. 356-368. (218.65 KB)
(218.65 KB). What Is Ontology Merging? - A Category-Theoretical Perspective Using Pushouts. In 20th National Conference on Artificial Intelligence, AAAI-05; 2005. (0 bytes)
(0 bytes). A cartesian closed category of approximable concept structures. In A cartesian closed category of approximable concept structures. 2004. (0 bytes)
(0 bytes). Default Reasoning over Domains and Concept Hierarchies. In Default Reasoning over Domains and Concept Hierarchies. 2004. (190.54 KB)
(190.54 KB). The Integration of Connectionism and First-Order Knowledge Representation and Reasoning as a Challenge for Artificial Intelligence. In Third International Conference on Information. Tokyo, Japan; 2004. (166.22 KB)
(166.22 KB). Logic Programs, Iterated Function Systems, and Recurrent Radial Basis Function Networks. Journal of Applied Logic. 2004 ;:273- 300. (303.97 KB)
(303.97 KB). Continuity of Semantic Operators in Logic Programming and their Approximation by Artificial Neural Networks. In the 26th Annual German Conference on Artificial Intelligence, KI2003. Hamburg, Germany; 2003. p. 105-119. (247.39 KB)
(247.39 KB). Formal Concept Analysis and Resolution in Algebraic Domains. In ICCS 2003. Shaker Verlag, Aachen; 2003. p. 205-221. (161.87 KB)
(161.87 KB). Generalized Metrics and Uniquely Determined Logic Programs. Theoretical Computer Science. 2003 ;:187-219. (419.06 KB)
(419.06 KB). A Resolution Theorem for Algebraic Domains. In IJCAI-03. Acapulco, Mexico; 2003. p. 1339-1340. (148.25 KB)
(148.25 KB). Towards a Systematic Account of Different Logic Programming Semantics. In 26th Annual German Conference on Artificial Intelligence, KI2003. Hamburg, Germany; 2003. p. 355-369. (211.68 KB)
(211.68 KB). Characterizing Logic Programming Semantics with Level Mappings. In WLP: Workshop Logische Programmierung; 2002. (0 bytes)
(0 bytes). The Fixed-Point Theorems of Priess-Crampe and Ribenboim in Logic Programming. In 2002. (0 bytes)
(0 bytes). ILP Operators for Propositional Connectionist Networks. Technische Berichte Technical Reports. WLP: Workshop Logische Programmierung; 2002 ;:103-106. (179.84 KB)
(179.84 KB). Towards Nonmonotonic Reasoning on Hierarchical Knowledge. In WLP: Workshop Logische Programmierung; 2002. (0 bytes)
(0 bytes). The Well-Founded Semantics is a Stratified Fitting Semantics. In The Well-Founded Semantics is a Stratified Fitting Semantics. 2002. (0 bytes)
(0 bytes). A "Converse" of the Bananch Contraction Mapping Theorem. Journal of Electrical Engineering. 2001 ;:3-6. (172.7 KB)
(172.7 KB). Kontraktionssatze auf verallgemeinerten metrischen Raumen. In 2001. (0 bytes)
(0 bytes). Semantic Operators and Fixed-Point Theory in Logic Programming. In 7th International Conference on Information Systems Analysis and Synthesis (ISAS 2001). Orlando, Florida, USA; 2001. p. 224-229. (1.77 MB)
(1.77 MB). Unique Supported-Model Classes of Logic Programs. Information. 2001 ;:295-302. (177.12 KB)
(177.12 KB). VDM meets LCF: Domain-Theoretic and Topological Aspects of VDM. In Fifth Irish Workshop on Formal Methods (IWFM'01); 2001.
. Classes of Logic Programs which Possess Unique Supported Models. In Classes of Logic Programs which Possess Unique Supported Models. 2000. (0 bytes)
(0 bytes). On the Coincidence of Semantics for Uniquely Determined Programs. In On the Coincidence of Semantics for Uniquely Determined Programs. 2000.
. Der Banachsche Fixpunktsatz und der Satz von Picard-Lindelof. In 2000. (0 bytes)
(0 bytes). Dislocated Topologies. 2000 ;. (170.64 KB)
(170.64 KB). Dislocated Topologies. 2000.