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
- Certain Answers in a Rough World + (1193)
- Axiom Dependency Hypergraphs for Fast Modularisation and Atomic Decomposition + (1193)
- Towards Parallel Repair: An Ontology Decomposition-based Approach + (1193)
- Detecting Conjunctive Query Differences between ELHr-Terminologies using Hypergraphs + (1193)
- Brave and Cautious Reasoning in EL + (1193)
- Mary, What's Like All Cats? + (1193)
- DeaLing with Ontologies using CODs + (1193)
- Evaluation of Extraction Techniques for Ontology Excerpts + (1193)
- Bayesian Description Logics + (1193)
- Fuzzy DLs over Finite Lattices with Nominals + (1193)
- Gödel FL_0 with Greatest Fixed-Point Semantics + (1193)
- Gödel Description Logics with General Models + (1193)
- Matching with respect to general concept inclusions in the Description Logic EL + (1193)
- How to Best Nest Regular Path Queries + (1193)
- Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs + (1193)
- Interactive ontology revision + (12)
- Termersetzungssysteme, Skript zur Vorlesung + (12)
- The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics + (12)
- Runtime Verification Using the Temporal Description Logic ALC-LTL Revisited + (12)
- Extending Unification in EL to Disunification: The Case of Dismatching and Local Disunification + (12)
- Probabilistic Model Checking for Feature-oriented Systems + (12)
- Context-Dependent Views to Axioms and Consequences of Semantic Web Ontologies + (12--13)
- Performance Evaluation of Thermal-Constrained Scheduling Strategies in Multi-core Systems + (12039)
- Many-Valued Horn Logic is Hard + (1205)
- Logics for Reasoning about Preferences, Uncertainty, and Vagueness + (1205)
- Just: a Tool for Computing Justifications w.r.t. EL Ontologies + (1207)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints + (12078)
- Minimal witnesses for probabilistic timed automata + (12302)
- Components in Probabilistic Systems: Suitable by Construction + (12476)
- A New Approach for Combining Decision Procedures for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method + (1249)
- Proceedings of the Eleventh International Conference on Concept Lattices and Their Applications, Košice, Slovakia, October 7-10, 2014 + (1252)
- Weak Bisimulation for Fully Probabilistic Processes + (1254)
- Symbolic Model Checking for Probabilistic Processes + (1256)
- Towards an FCA-based Recommender System for Black-Box Optimization + (1257)
- On Language Equations with One-sided Concatenation + (126)
- Approximated Determinisation of Weighted Tree Automata + (12638)
- Sequentiality of Group-Weighted Tree Automata + (12638)
- COBRA, a Demo + (1265)
- All But Not Nothing: Left-Hand Side Universals for Tractable OWL Profiles + (1265)
- "Most of" leads to undecidability: Failure of adding frequencies to LTL + (12650)
- Exploiting forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment + (12678)
- The Power of the Terminating Chase + (127)
- Visualization of Statistical Information in Concept Lattice Diagrams + (12733)
- Approximate Computation of Exact Association Rules + (12733)
- A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic + (12941)
- LTL over Description Logic Axioms + (13)
- Fuzzy Answer Sets Approximations + (13)
- Business lexicography + (13)
- Synthesis of Reo Connectors for Strategies and Controllers + (130)
- An Ontology Design Pattern for Activity Reasoning + (1302)
