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
- Admissibility in Probabilistic Argumentation + (74)
- Symbolic model checking for channel-based component connectors + (74)
- Waiting for Locks: How Long Does It Usually Take? + (7437)
- Fixed Parameter Tractable Reasoning in DLs via Decomposition + (745)
- Proceedings of the 24th International Workshop on Description Logics (DL 2011), Barcelona, Spain, July 13-16, 2011 + (745)
- Implementing completion-based inferences for the el-family + (745)
- Correcting Access Restrictions to a Consequence More Flexibly + (745)
- Fuzzy Ontologies over Lattices with T-norms + (745)
- GCIs Make Reasoning in Fuzzy DL with the Product T-norm Undecidable + (745)
- Unification in the Description Logic EL without the Top Concept + (745)
- Nominal Schemas for Integrating Rules and Description Logics + (745)
- Playing Stochastic Games Precisely + (7454)
- A Semantics for Open Normal Defaults via a Modified Preferential Approach + (747)
- Web Reasoning and Rule Systems - 6th International Conference, RR 2012, Vienna, Austria, September 10-12, 2012. Proceeding + (7497)
- A Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Lattices + (7497)
- Recent Advances in Integrating OWL and Rules + (7497)
- Alternating-time stream logic for multi-agent systems + (75)
- Simple restriction in context-free rewriting + (76)
- Temporal Tableaux + (76)
- Synthesis of Reo circuits from scenario-based interaction specifications + (76)
- On Properties and State Complexity of Deterministic State-Partition Automata + (7604)
- A Goal-Oriented Algorithm for Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies + (7691)
- Identifying and Modelling Polysemous Senses of Spatial Prepositions in Referring Expressions + (77)
- Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems + (7773)
- Computing with Logic as Operator Elimination: The ToyElim System + (7773)
- Finite Lattices Do Not Make Reasoning in ALCI Harder + (778)
- Computing Quantiles in Markov Reward Models + (7794)
- A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem + (78)
- How to Tell Easy from Hard: Complexities of Conjunctive Query Entailment in Extensions of ALC + (78)
- On restricted context-free grammars + (78)
- SNOMED reaching its adolescence: Ontologists' and logicians' health check + (78)
- A Probabilistic Quantitative Analysis of Probabilistic-Write/Copy-Select + (7871)
- Towards an Error-Tolerant Construction of EL^ -Ontologies from Data Using Formal Concept Analysis + (7880)
- Mathematical Morphology Operators over Concept Lattices + (7880)
- The Semantic Web: Semantics and Big Data, 10th International Conference, ESWC 2013, Montpellier, France, May 26-30, 2013. Proceedings + (7882)
- An Ontology Design Pattern for Cartographic Map Scaling + (7882)
- Learning Formal Definitions for Snomed CT from Text + (7885)
- Temporalizing Ontology-Based Data Access + (7898)
- Soundness of Inprocessing in Clause Sharing SAT Solvers + (7962)
- Parallel MUS Extraction + (7962)
- Efficient Separability of Regular Languages by Subsequences and Suffixes + (7966)
- Towards an Efficient Algorithm to Reason over Description Logics Extended with Nominal Schemas + (7994)
- Sharing Information in Parallel Search with Search Space Partitioning + (7997)
- Artificial General Intelligence - 6th International Conference, AGI 2013, Beijing, China, July 31 - August 3, 2013 Proceedings + (7999)
- Type-elimination-based Reasoning for the Description Logic SHIQbs using Decision Diagrams and Disjunctive Datalog + (8)
- Unification in Commutative Theories + (8)
- Unification Theory + (8)
- Practical Reasoning for Very Expressive Description Logics + (8)
- Formal representation of complex SNOMED CT expressions + (8)
- Benchmark libraries for argumentation + (8)
- Quantitative Characterization of Reconfigurable Transistor Logic Gates + (8)
- One-Variable Logic Meets Presburger Arithmetic + (802)
- On the State Complexity of the Reverse of R- and J-Trivial Regular Languages + (8031)
- SAT-Based Analysis and Quantification of Information Flow in Programs + (8054)
