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
- Computing Role-depth Bounded Generalizations in the Description Logic ELOR + (49-60)
- A Generic Approach for Large-Scale Ontological Reasoning in the Presence of Access Restrictions to the Ontology's Axioms + (49-64)
- Fast Modularisation and Atomic Decomposition of Ontologies using Axiom Dependency Hypergraphs + (49-64)
- Modeling and Querying Video Databases + (492-498)
- Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator + (492-502)
- Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable + (492–501)
- Controller Synthesis for Probabilistic Systems + (493--506)
- Completing the Picture: Complexity of Graded Modal Logics with Converse + (493--520)
- A Goal-Oriented Algorithm for Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies + (493-504)
- A Framework for Intuitionistic Grammar Logics + (495-503)
- Modal Schema Graphs for Graph Databases + (498-512)
- Characterizing the Semantics of Terminological Cycles in ALN using Finite Automata + (499-510)
- Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics + (49–65)
- Logics with Concrete Domains: First-Order Properties, Abstract Expressive Power, and (Un)Decidability + (5-17)
- KI-96: Lecture Notes in Artificial Intelligence + (5-18)
- Axiom Pinpointing in General Tableaux + (5-34)
- An Overview of Tableau Algorithms for Description Logics + (5-40)
- Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation + (50--61)
- Introducing Wikidata to the Linked Data Web + (50-65)
- Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures + (50-65)
- Minimal witnesses for probabilistic timed automata + (501--517)
- Metric semantics for true concurrent real time + (501--542)
- Evaluating Abstract Dialectical Frameworks with ASP + (505-506)
- IASCAR: Incremental Answer Set Counting by Anytime Refinement + (505-532)
- Temporalizing Rewritable Query Languages over Knowledge Bases + (50–70)
- Cardinality Restrictions on Concepts + (51-62)
- Finite Lattices Do Not Make Reasoning in ALCI Harder + (51-62)
- Temporal Query Answering in DL-Lite with Negation + (51-65)
- Propositional Dynamic Logic with Recursive Programs + (51-69)
- Probabilistic Aspects of Score Systems + (51-74)
- A Core Method for the Weak Completion Semantics with Skeptical Abduction + (51-86)
- Neural Machine Translating from Natural Language to SPARQL + (510-519)
- A Compositional Framework for Controller Synthesis + (512--527)
- Verification of Context-Sensitive Knowledge and Action Bases + (514--528)
- Decentralized Supervisory Control with Communicating Supervisors Based on Top-Down Coordination Control + (5149-5155)
- Computing Conditional Probabilities in Markovian Models Efficiently + (515--530)
- Model checking linear-time properties of probabilistic systems + (519--570)
- Improving Resource-Unaware SAT Solvers + (519-534)
- Concept lattices with negative information: A characterization theorem + (51–62)
- Many-Valued Horn Logic is Hard + (52-58)
- Sharing Information in Parallel Search with Search Space Partitioning + (52-58)
- Concurrent Production, Consumption and Occupation + (52-64)
- A PSpace Algorithm for Graded Modal Logic + (52-66)
- Pinpointing in the Description Logic EL + (52-67)
- Ontology-based Interpretation of Keywords for Semantic Search + (523-536)
- Model-Checking Algorithms for Continuous-Time Markov Chains + (524--541)
- An Abstract Logical Approach to Characterizing Strong Equivalence in Logic-based Knowledge Representation Formalisms + (525--528)
- Two Restrictions on Contraction + (525-529)
- Mary, What's Like All Cats? + (526-529)
- About Subsumption in Fuzzy EL + (526-538)
