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
- More for Less: Safe Policy Improvement with Stronger Performance Guarantees + (4406--4415)
- Temporally Attributed Description Logics + (441-474)
- Completeness and soundness guarantees for conjunctive SPARQL queries over RDF data sources with completeness statements + (441-482)
- Compositional Construction of Most General Controllers + (443--482)
- Deciding Unifiability and Computing Local Unifiers in the Description Logic EL without Top Constructor + (443–476)
- Deduktion: von der Theorie zur Anwendung + (444-451)
- Generic Emptiness Check for Fun and Profit + (445-461)
- Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles + (446-451)
- Bayesian Description Logics + (447-458)
- Unification Theory + (447-533)
- Nested Sequents for Quantified Modal Logics + (449--467)
- Reduction Techniques for Model Checking Markov Decision Processes + (45--54)
- ProFeat: feature-oriented engineering for family-based probabilistic model checking + (45--75)
- UEL: Unification Solver for the Description Logic EL – System Description + (45-51)
- Blackhole State-Controlled Regulated Pushdown Automata + (45-56)
- Approximating the Semantics of Logic Programs by Recurrent Neural Networks + (45-58)
- NExpTime-complete Description Logics with Concrete Domains + (45-60)
- Identifying and Modelling Polysemous Senses of Spatial Prepositions in Referring Expressions + (45-61)
- Supervisory Control with Complete Observations + (45-64)
- On the complexity of enumerating pseudo-intents + (450-466)
- Complexity Boundaries for Horn Description Logics + (452--457)
- A Scheme for Integrating Concrete Domains into Concept Languages + (452-457)
- Are Good-for-Games Automata Good for Probabilistic Model Checking? + (453--465)
- Conservative Extensions in Expressive Description Logics + (453-458)
- Fostering Web Intelligence by Semi-automatic OWL Ontology Refinement + (454-460)
- Towards Propositional KLM-Style Defeasible Standpoint Logics + (459–475)
- Updating Description Logic ABoxes + (46-56)
- Revisiting Grounded Circumscription in Description Logics + (46-60)
- A Finite Basis for the Set of EL-Implications Holding in a Finite Model + (46-61)
- A Recursive Neural Network for Reflexive Reasoning + (46-62)
- The ASPARTIX System Suite + (461-462)
- EL-ifying Ontologies + (464--479)
- Quo Vadis, CS? - On the (non)-impact of Conceptual Structures on the Semantic Web + (464-467)
- Logic Programs under Three-Valued Łukasiewicz's Semantics + (464-478)
- On the probabilistic bisimulation spectrum with silent moves + (465---512)
- Waiting for Locks: How Long Does It Usually Take? + (47--62)
- Investigating the Dimensions of Spatial Language + (47-56)
- Effektiver Algorithmus zur Lösung von inversen Aufgabenstellungen - Anwendung in der Geotechnik + (470--481)
- DIAMOND 3.0 -- A Native C++ Implementation of DIAMOND + (471--472)
- DIAMOND 3.0 - A Native C++ Implementation of DIAMOND + (471-472)
- Evaluation of Extraction Techniques for Ontology Excerpts + (471-482)
- A Categorical Characterization of Consistency Results + (473--486)
- Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals + (473-480)
- Implementing Instantiation of Knowledge Bases in Argumentation Frameworks + (475--476)
- Non-monotonic Extensions to Formal Concept Analysis via Object Preferences + (476–492)
- Neva – Extension Visualization for Argumentation Frameworks + (477-478)
- Computing the lcs w.r.t. General EL^+ TBoxes + (477-488)
- Unification in Commutative Theories, Hilbert's Basis Theorem and Gröbner Bases + (477-503)
- Linear Context-Free Tree Languages and Inverse Homomorphisms + (478-489)
- The Hanoi Omega-Automata Format + (479--486)
