Library
Export 162 results:
Filters: Author is Pascal Hitzler [Clear All Filters]
. Acceptable Programs Revisited. In Workshop on Verification in Logic Programming, 16th International Conference on Logic Programming (ICLP'99),; 1999. 
(1.1 MB)
(1.1 MB). Acquisition of OWL DL Axioms from Lexical Resources. In 4th European Semantic Web Conference. Innsbruck, Austria; 2007. (153.34 KB)
(153.34 KB). An Algorithm for Computing Inconsistency Measurement by Paraconsistent Semantics. In Proceedings of Ninth European Conference on Symbolic and Quanlitative Approaches to Reasoning with Uncertainty. Hammamet,Tunisia; 2007. p. 91-102. (494.11 KB)
(494.11 KB). Algorithms for Paraconsistent Reasoning with OWL. In 4th European Semantic Web Conference, ESWC2007. Innsbruck, Austria; 2007.
. Alignment-based Querying of Linked Open Data. ODBASE 2012. Rome, Italy; 2012. p. 807-824. (287.23 KB)
(287.23 KB). An Anytime Algorithm for Computing Inconsistency Measurement. In Third International Conference, KSEM 2009. 2009. (238.94 KB)
(238.94 KB). Any-World Access to OWL from Prolog. In 30th Annual German Conference on AI. KI, Osnabruck, Germany: Advances in Artificial Intelligence, 30th Annual German Conference on AI, KI 2007; 2007. p. 84-98. (197.72 KB)
(197.72 KB). Approximate Instance Retrieval on Ontologies. In 21st International Conference, DEXA 2010. Bilbao, Spain; 2010. (477.48 KB)
(477.48 KB). Approximate OWL Instance Retrieval with Screech. In Approximate OWL Instance Retrieval with Screech. 2008. 
(0 bytes)
(0 bytes). Approximate OWL-Reasoning with Screech. In International Conference, RR 2008. Karlsruhe, Germany: Second International Conference, RR 2008; 2008. p. 165-180. (200.54 KB)
(200.54 KB). Automatic Domain Identification for Linked Open Data. In 2013 IEEE/WIC/ACM International Conference on Web Intelligence. Atlanta, GA: ACM; 2013. (1.16 MB)
(1.16 MB). Automatisiertes Schließen mit formalen Begriffen: Mathematische Grundlagen. In 2005. (0 bytes)
(0 bytes). A Better Uncle For OWL - Nominal Schemas for Integrating Rules and Ontologies. In International World Wide Web Conference (WWW2011). New York: Proceedings of the 20th International World Wide Web Conference (WWW2011); 2011. (406.28 KB)
(406.28 KB). Bridging the Paradigm Gap with Rules for OWL. In W3C Workshop on Rule Languages for Interoperability; 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). A Characterization of Acceptability. In A Characterization of Acceptability. 1999.
. Characterizations of Classes of Programs by Three-valued Operators. In Characterizations of Classes of Programs by Three-valued Operators. 1999. (0 bytes)
(0 bytes). Characterizing Logic Programming Semantics with Level Mappings. In WLP: Workshop Logische Programmierung; 2002. (0 bytes)
(0 bytes). Cheap Boolean Role Constructors for Description Logics. In 11th European Conference on Logics in Artificial Intelligence (JELIA). Dresden, Germany; 2008. p. 362-374. (160.41 KB)
(160.41 KB). Classes of Logic Programs which Possess Unique Supported Models. In Classes of Logic Programs which Possess Unique Supported Models. 2000. (0 bytes)
(0 bytes). A Coherent Well-founded Model for Hybrid MKNF Knowledge Bases. In 18th European Conference on Artificial Intelligence, ECAI. Patras, Greece: 18th European Conference on Artificial Intelligence, ECAI 2008; 2008. p. 99-103. (163.1 KB)
(163.1 KB). On the Coincidence of Semantics for Uniquely Determined Programs. In On the Coincidence of Semantics for Uniquely Determined Programs. 2000.
. A Comparison of Disjunctive Well-founded Semantics. In Foundations of Artificial Intelligence (FAInt-07); 2007. (0 bytes)
(0 bytes). Complexity Boundaries for Horn Description Logics. In The 22nd AAAI Conference on Artficial Intelligence. Vancouver, British Columbia, Canada; 2007. (198.68 KB)
(198.68 KB). On the Complexity of Horn Description Logics. In Second Workshop OWL - Experiences and Directions, OWLED2006; 2006. (0 bytes)
(0 bytes). Complexity of Horn Description Logics. 2007. (0 bytes)
(0 bytes). Computational Complexity and Anytime Algorithm for Inconsistency Measurement. International Journal of Software and Informatics. 2010 ;:3-21. (478.9 KB)
(478.9 KB). 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). Computing Inconsistency Measure based on Paraconsistent Semantics. 2011 ;. (459.85 KB)
(459.85 KB). Concept Learning in Description Logics Using Refinement Operators. Machine Learning. 2010 ;:203-250. (1.05 MB)
(1.05 MB). Conjunctive Queries for a Tractable Fragment of OWL 1.1. In 6th International Semantic Web Conference, 2nd Asian Semantic Web Conference, ISWC 2007 + ASWC. Busan, Korea: The Semantic Web, 6th International Semantic Web Conference, 2nd Asian Semantic Web Conference, ISWC 2007 + ASWC; 2007. p. 310-323. (133.64 KB)
(133.64 KB). Connectionist Model Generation: A First-Order Approach. Neurocomputing. 2008 ;:2420-2432. (581.02 KB)
(581.02 KB). Contextual Ontology Alignment of LOD With an Upper Ontology: A Case Study With Proton. In 8th Extended Semantic Web Conference, ESWC 2011. Greece: Proceedings of 8th Extended Semantic Web Conference, ESWC 2011; 2011. (366.02 KB)
(366.02 KB). Contextual Ontology Alignment of LOD with an Upper Ontology: A Case Study with Proton. ESWC 2011. Heraklion, Greece: Springer; 2010. p. 80-92.
. 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). A "Converse" of the Bananch Contraction Mapping Theorem. Journal of Electrical Engineering. 2001 ;:3-6. (172.7 KB)
(172.7 KB). The Core Method: Connectionist Model Generation for First-Order Logic Programs. In 2007. (0 bytes)
(0 bytes). Decidability Under the Well-Founded Semantics. In First International Conference on Web Reasoning and Rule Systems, RR2007. Innsbruck, Austria; 2007. (70 KB)
(70 KB). Default Reasoning over Domains and Concept Hierarchies. In Default Reasoning over Domains and Concept Hierarchies. 2004. (190.54 KB)
(190.54 KB). Defeasible Inference with Circumscriptive OWL Ontologies. In 5th European Semantic Web Conference, ESWC08; 2008. (0 bytes)
(0 bytes). Der Banachsche Fixpunktsatz und der Satz von Picard-Lindelof. In 2000. (0 bytes)
(0 bytes). Der Kontraktionssatz auf metrischen Raumen. In 1997. (0 bytes)
(0 bytes). 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). Description Logic Programs: Normal Forms. In FAInt-07; 2007. (0 bytes)
(0 bytes). Description Logic Reasoning with Decision Diagrams: Compiling SHIQ to Disjunctive Datalog. In The Semantic Web - ISWC 2008, 7th International Semantic Web Conference, 2008. Karlsruhe, Germany: The Semantic Web - ISWC 2008, 7th International Semantic Web Conference; 2008. p. 435-450. (150.02 KB)
(150.02 KB). Description Logic Rules. In 18th European Conference on Artificial Intelligence, ECAI. Patras, Greece; 2008. p. 80-84. (179.06 KB)
(179.06 KB). Dimensions of Neural-Symbolic Integration - A Structured Survey. In 2005. (0 bytes)
(0 bytes). Dislocated Topologies. 2000 ;. (170.64 KB)
(170.64 KB)