Search by property
From International Center for Computational Logic
This page provides a simple browsing interface for finding entities described by a property and a named value. Other available search interfaces include the page property search, and the ask query builder.
List of results
- 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)
- Formale Systeme + (Zusammenfassung und Ausblick)
- Concurrency Theory + ([http://www.cs.unibo.it/~sangio/DOC_public/CoinBookPart2.pdf Coinduction: Examples, Duality to Induction, and Proof Techniques])
- Concurrency Theory + ([http://www.cs.unibo.it/~sangio/DOC_public/CoinBookPart3.pdf Algebraic Properties of Bisimilarity])
- Foundations of Knowledge Representation + (bank holiday)
- cf2 Semantics Revisited + (cf2 Semantics Revisited)
- dARe -- Using Argumentation to Explain Conclusions from a Controlled Natural Language Knowledge Base + (dARe -- Using Argumentation to Explain Conclusions from a Controlled Natural Language Knowledge Base)
- Concurrency Theory + (dies academicus)
- flexABle – System Description for ICCMA 2023 + (flexABle – System Description for ICCMA 2023)
- goDIAMOND 0.6.6 - ICCMA 2017 System Description + (goDIAMOND 0.6.6 - ICCMA 2017 System Description)
- jcel: A Modular Rule-based Reasoner + (jcel: A Modular Rule-based Reasoner)
- Complexity Theory + (moved to December 19)
- Foundations of Knowledge Representation + (no exercise)
- Concurrency Theory + (no exercise)
- Models of Concurrent Systems + (no lecture)
- Foundations of Knowledge Representation + (no lecture)
- Foundations of Knowledge Representation + (no lecture)
- Concurrency Theory + (no session)
- Concurrency Theory + (no session)
- Concurrency Theory + (no session)
- npSolver - a SAT based Solver for Optimization Problems (System Description) + (npSolver - a SAT based Solver for Optimization Problems (System Description))
- npSolver - a SAT based Solver for Optimization Problems + (npSolver - a SAT based Solver for Optimization Problems)
- riss 2010 Solver Description + (riss 2010 Solver Description)
- Formale Systeme + (Äquivalenz und Normalformen)
- Formale Systeme + (Äquivalenz und Normalformen)
- Formale Systeme + (Äquivalenzen und Normalformen)
- Theoretische Informatik und Logik + (Übung 1)
- Theoretische Informatik und Logik + (Übung 10)
- Theoretische Informatik und Logik + (Übung 11)
- Theoretische Informatik und Logik + (Übung 12)
- Theoretische Informatik und Logik + (Übung 2)
- Theoretische Informatik und Logik + (Übung 3)
- Theoretische Informatik und Logik + (Übung 4)