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
- Establishing Qualitative Properties for Probabilistic Lossy Channel Systems: An Algorithmic Approach + (34--52)
- Domain equations for probabilistic processes + (34--54)
- Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory + (34--74)
- Unification of Concept Terms in Description Logics + (34-38)
- Representing and Reasoning on Conceptual Queries Over Image Databases + (340-348)
- A Neutral Temporal Deontic STIT Logic + (340-354)
- On the Foundations of Cycles in Bayesian Networks + (343--363)
- Ratio and Weight Quantiles + (344--356)
- Extending Description Logic Rules + (345--359)
- Unification in Commutative Idempotent Monoids + (345-352)
- Deciding the Word Problem in the Union of Equational Theories + (346-390)
- On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems + (347--361)
- A Local System for Classical Logic + (347-361)
- Determinacy of Real Conjunctive Queries. The Boolean Case + (347–358)
- Playing Stochastic Games Precisely + (348--363)
- Advances in Symbolic Probabilistic Model Checking with PRISM + (349--366)
- Computing Conditional Probabilities: Implementation and Evaluation + (349--366)
- Multi-Flip Networks: Parallelizing GenSAT + (349-360)
- Witnessing Subsystems for Probabilistic Systems with Low Tree Width + (35--51)
- Towards an FCA-based Recommender System for Black-Box Optimization + (35-42)
- Using Connectionist Term Representations for First-Order-Deduction- A Critical View + (35-42)
- The WHILE Hierarchy of Program Schemes is Infinite + (35-47)
- DNA-Computing - ein funktionales Modell im laborpraktischen Experiment + (35-52)
- Unification in the Description Logic EL + (350-364)
- Default reasoning over domains and concept hierarchies + (351-365)
- Combination of Constraint Solving Techniques: An Algebraic Point of View + (352-366)
- Computing Quantiles in Markov Reward Models + (353--368)
- ShareAlike Your Data: Self-referential Usage Policies for the Semantic Web + (354-369)
- ADF - BDD : An ADF Solver Based on Binary Decision Diagrams + (355-356)
- Representing Concurrent Action and Solving Conflicts + (355-368)
- Towards a Systematic Account of Different Logic Programming Semantics + (355-369)
- Model Checking Continuous-Time Markov Chains by Transient Analysis + (358--372)
- A Journey to the Frontiers of Query Rewritability + (359-367)
- Second-Order Characterizations of Definientia in Formula Classes + (36-37)
- Access rights and collaborative ontology integration for reuse across security domains + (36-40)
- Detecting Synonymous Properties by Shared Data-driven Definitions + (360-375)
- PMC-VIS: An Interactive Visualization Tool for Probabilistic Model Checking + (361--375)
- A Description Logic for Vague Knowledge + (361-365)
- Cheap Boolean Role Constructors for Description Logics + (362-374)
- On the Complexity of k-Piecewise Testability and the Depth of Automata + (364-376)
- On context-free rewriting with a simple restriction and its computational completeness + (365-378)
- Left-forbidding cooperating distributed grammar systems + (3661-3667)
- Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets + (369-384)
- On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics + (36:1--36:15)
- Reachability in Dynamical Systems with Rounding + (36:1--36:17)
- Objects, Specificity, Logic, and Change + (37-42)
- A Goal-Oriented Algorithm for Unification in EL w.r.t. Cycle-Restricted TBoxes + (37-47)
- Efficient OWL Reasoning with Logic Programs - Evaluations + (370-373)
- An open architecture for multiple case retrieval methods + (373-380)
- Ontologies for Knowledge Graphs: Breaking the Rules + (376-392)
