Suche mittels Attribut
Aus International Center for Computational Logic
Diese Seite stellt eine einfache Suchoberfläche zum Finden von Objekten bereit, die ein Attribut mit einem bestimmten Datenwert enthalten. Andere verfügbare Suchoberflächen sind die Attributsuche sowie der Abfragengenerator.
Liste der Ergebnisse
- What Is Approximate Reasoning? + (What Is Approximate Reasoning?)
- What Is Ontology Merging? – A Category-Theoretical Perspective Using Pushouts + (What Is Ontology Merging? – A Category-Theoretical Perspective Using Pushouts)
- What Is a Reasonable Argumentation Semantics? + (What Is a Reasonable Argumentation Semantics?)
- Concurrency Theory + (What is Decidable about Petri Nets?)
- What's in a name? — First Steps Towards a Structural Approach to Integrating Large Content-based Knowledge-Bases + (What's in a name? — First Steps Towards a Structural Approach to Integrating Large Content-based Knowledge-Bases)
- What's in an Attribute? Consequences for the Least Common Subsumer + (What's in an Attribute? Consequences for the Least Common Subsumer)
- What's new in Description Logics + (What's new in Description Logics)
- What's not in a name? Initial Explorations of a Structural Approach to Integrating Large Concept Knowledge-Bases + (What's not in a name? Initial Explorations of a Structural Approach to Integrating Large Concept Knowledge-Bases)
- Foundations of Semantic Web Technologies + (Whatever is left over from the last tutorials :))
- Wheat and Chaff -- Practically Feasible Interactive Ontology Revision + (Wheat and Chaff -- Practically Feasible Interactive Ontology Revision)
- When are timed automata determinizable? + (When are timed automata determinizable?)
- Where do business students turn for help? An empirical study on dictionary use in foreign-language learning + (Where do business students turn for help? An empirical study on dictionary use in foreign-language learning)
- Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard? + (Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?)
- Why propositional quantification makes modal logics on trees robustly hard ? + (Why propositional quantification makes modal logics on trees robustly hard ?)
- LATPub437 + (Wie findet man die verantwortliche Axiome? Axiom-Pinpointing in Beschreibungslogiken)
- Knowledge Graphs + (Wikidata)
- Knowledge Graphs + (Wikidata)
- Wikidata as a Cultural Heritage Information Hub + (Wikidata as a Cultural Heritage Information Hub)
- Knowledge Graphs + (Wikidata, the Wikimedia knowledge graph)
- Wikidata: The Making Of + (Wikidata: The Making Of)
- Wikidata: a free collaborative knowledgebase + (Wikidata: a free collaborative knowledgebase)
- Wikipedia 3.0: MediaWiki meets the Semantic Web + (Wikipedia 3.0: MediaWiki meets the Semantic Web)
- Wikipedia and the Semantic Web - The Missing Links + (Wikipedia and the Semantic Web - The Missing Links)
- Wikipedia and the Semantic Web, Part II + (Wikipedia and the Semantic Web, Part II)
- Formale Systeme + (Willkommen/Einleitung formale Sprachen)
- Formale Systeme + (Willkommen/Einleitung formale Sprachen)
- Winning Snake: Design Choices in Multi-Shot ASP + (Winning Snake: Design Choices in Multi-Shot ASP)
- Winning Snake: Design Choices in Multi-Shot ASP + (Winning Snake: Design Choices in Multi-Shot ASP)
- Wissen als Code: Die Welt der Wissensgraphen und Ontologien + (Wissen als Code: Die Welt der Wissensgraphen und Ontologien)
- Witnessing Subsystems for Probabilistic Systems with Low Tree Width + (Witnessing Subsystems for Probabilistic Systems with Low Tree Width)
- Wolpertinger: A Fixed-Domain Reasoner + (Wolpertinger: A Fixed-Domain Reasoner)
- Working with Knowledge Graphs + (Working with Knowledge Graphs)
- Workshop Deduktion der 20. Jahrestagung für Künstliche Intelligenz + (Workshop Deduktion der 20. Jahrestagung für Künstliche Intelligenz)
- Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting + (Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting)
- Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting + (Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting)
- Worst-case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2 + (Worst-case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2)
- Models of Concurrent Systems + (Wrap-Up)
- Complexity Theory + (Wrapup and Outlook)
- Academic Skills in Computer Science + (Writing & LaTeX)
- Academic Skills in Computer Science + (Writing & Typesetting)
- Academic Skills in Computer Science + (Writing Research Reports)
- Academic Skills in Computer Science + (Writing Research Reports ctd.)
- Academic Skills in Computer Science + (Writing Research Reports fin.)
- Academic Skills in Computer Science + (Writing and Structure)
- Academic Skills in Computer Science + (Writing and Structure)
- Academic Skills in Computer Science + (Writing research reports)
- Foundations of Semantic Web Technologies + (XML& RDF)
- Finite and algorithmic model theory + (Zero-One Laws of FO)
- Finite and algorithmic model theory (22/23) + (Zero-One Laws of FO)
- Zur Integration von fall- und regelbasierten Verfahren im Entwicklungssystem FAENSY + (Zur Integration von fall- und regelbasierten Verfahren im Entwicklungssystem FAENSY)
- Formale Systeme + (Zusammenfassung und Ausblick)
- Formale Systeme + (Zusammenfassung und Ausblick)