Suche mittels Attribut

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

• Advances in probabilistic model checking with PRISM: variable reordering, quantiles and weak deterministic Büchi automata  + (20)
• Foundations of probability-raising causality in Markov decision processes  + (20)
• Comparative branching-time semantics for Markov chains  + (200)
• Combining Constraint Solving  + (2002)
• Proceedings of the Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2017)  + (2013)
• Approximating Resultants of Existential Second-Order Quantifier Elimination upon Universal Relational First-Order Formulas  + (2013)
• Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting  + (2022)
• The Orbit Problem for Parametric Linear Dynamical Systems  + (203)
• Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking  + (203)
• A new combination procedure for the word problem that generalizes fusion decidability results in modal logics  + (204)
• On the Ontological Modeling of Trees  + (2043)
• Proceedings of the 8th Workshop on Ontology Design and Patterns (WOP 2017) co-located with the 16th International Semantic Web Conference (ISWC 2017)  + (2043)
• Quantitative Temporal Logics: PSpace and below  + (205)
• Approximating Operators and Semantics for Abstract Dialectical Frameworks  + (205)
• Talking about Forests: an Example of Sharing Information Expressed with Vague Terms  + (2050)
• Automata Can Show PSPACE Results for Description Logics  + (206)
• Practical Linked Data Access via SPARQL: The Case of Wikidata  + (2073)
• The Hybrid mu-Calculus  + (2083)
• The Inverse Method Implements the Automata Approach for Modal Satisfiability  + (2083)
• Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures  + (21)
• Completing the Picture: Complexity of Graded Modal Logics with Converse  + (21)
• Configuration of Inter-Process Communication with Probabilistic Model Checking  + (21)
• About the Expressive Power and Complexity of Order-Invariance with Two Variables  + (21)
• Model Checking with Formula-Dependent Abstract Models  + (2102)
• Formal Concept Analysis Methods for Dynamic Conceptual Graphs  + (2120)
• On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics  + (213)
• Proceedings of the 6th International Workshop "What can FCA do for Artificial Intelligence?"  + (2149)

• (Non-)Succinctness of uniform interpolants of general terminologies in the description logic ℰℒ  + (215)
• Checking Equivalence for Reo Networks  + (215)
• Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics  + (215)
• On the complexity of entailment in existential conjunctive first-order logic with atomic negation  + (215)
• Verifying Properties of Infinite Sequences of Description Logic Actions  + (215)

• On the complexity of Horn description logics  + (216)
• cf2 Semantics Revisited  + (216)
• KI 2001: Advances in Artificial Intelligence, Proceedings of the Joint German/Austrian Conference on AI (KI 2001)  + (2174)
• The Limits of Decidability in Fuzzy Description Logics with General Concept Inclusions  + (218)
• Complexity in Union-Free Regular Languages  + (22)
• Display to Labeled Proofs and Back Again for Tense Logics  + (22)
• Computing Probability Bounds for Linear Time Formulas over Concurrent Probabilistic Systems  + (22)
• On the Semantic Foundations of Probabilistic Synchronous Reactive Programs  + (22)
• Methods for Solving Reasoning Problems in Abstract Argumentation – A Survey  + (220)
• Tuple-Generating Dependencies Capture Complex Values  + (220)
• NEXAS: A Visual Tool for Navigating and Exploring Argumentation Solution Spaces  + (220146)
• ADF - BDD : An ADF Solver Based on Binary Decision Diagrams  + (220146)
• Efficient Model Construction for Horn Logic with VLog: Extended Abstract  + (2211)
• Happy Ever After: Temporally Attributed Description Logics  + (2211)
• Unification in a Description Logic with Transitive Closure of Roles  + (2250)
• A Local System for Classical Logic  + (2250)
• Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory  + (226)
• A Theory of Hypothesis Finding in Clausal Logic  + (2281)
• Synthesis of Reo circuits from scenario-based specifications  + (229(2))
• The cf2 argumentation semantics revisited  + (23)
• Keys, Nominals, and Concrete Domains  + (23)
• Solving a PSPACE-complete problem by gene assembly  + (23)
• Model Checking for Performability  + (23)