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

• Metric completion versus ideal completion  + (10.1007/978-1-4471-3078-9_16)
• Languages, Decidability, and Complexity  + (10.1007/978-1-4471-4276-8_2)
• Supervisory Control with Complete Observations  + (10.1007/978-1-4471-4276-8_3)
• Supervisory Control of Distributed Discrete-Event Systems  + (10.1007/978-1-4471-4276-8_6)
• Coordination Control of Distributed Discrete-Event Systems  + (10.1007/978-1-4471-4276-8_8)
• Formal Parameter Synthesis for Energy-Utility-Optimal Fault Tolerance  + (10.1007/978-3-030-02227-3_6)
• Partial and Conditional Expectations in Markov Decision Processes with Integer Weights  + (10.1007/978-3-030-17127-8_25)
• The 2019 Comparison of Tools for the Analysis of Quantitative Formal Models - (QComp 2019 Competition Report)  + (10.1007/978-3-030-17502-3_5)
• On the Complexity of Graded Modal Logics with Converse.  + (10.1007/978-3-030-19570-0\_42)
• Too Much Information: Can AI Cope With Modern Knowledge Graphs?  + (10.1007/978-3-030-21462-3_2)
• Discovering Implicational Knowledge in Wikidata  + (10.1007/978-3-030-21462-3_21)
• Temporally Attributed Description Logics  + (10.1007/978-3-030-22102-7_21)
• Presburger Concept Cardinality Constraints in Very Expressive Description Logics – Allegro sexagenarioso ma non ritardando  + (10.1007/978-3-030-22102-7_25)
• Compositional Feature-oriented Systems  + (10.1007/978-3-030-30446-1_9)
• From LTL to Unambiguous Büchi Automata via Disambiguation of Alternating Automata  + (10.1007/978-3-030-30942-8_17)
• Explainable Artificial Intelligence. Proceedings of the 15th Reasoning Web Summer School  + (10.1007/978-3-030-31423-1)
• Generic Emptiness Check for Fun and Profit  + (10.1007/978-3-030-31784-3_26)
• Modal Schema Graphs for Graph Databases  + (10.1007/978-3-030-33223-5_41)
• Ontology-Mediated Probabilistic Model Checking  + (10.1007/978-3-030-34968-4_11)
• Performance Evaluation of Thermal-Constrained Scheduling Strategies in Multi-core Systems  + (10.1007/978-3-030-44411-2_9)
• Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints  + (10.1007/978-3-030-45190-5_18)
• Minimal witnesses for probabilistic timed automata  + (10.1007/978-3-030-59152-6_28)
• Components in Probabilistic Systems: Suitable by Construction  + (10.1007/978-3-030-61362-4_13)
• Approximated Determinisation of Weighted Tree Automata  + (10.1007/978-3-030-68195-1_20)
• Sequentiality of Group-Weighted Tree Automata  + (10.1007/978-3-030-68195-1_21)

• "Most of" leads to undecidability: Failure of adding frequencies to LTL  + (10.1007/978-3-030-71995-1\_5)

• Exploiting forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment  + (10.1007/978-3-030-75775-5_13)
• Visualization of Statistical Information in Concept Lattice Diagrams  + (10.1007/978-3-030-77867-5_13)
• Approximate Computation of Exact Association Rules  + (10.1007/978-3-030-77867-5_7)
• Causality-Based Game Solving  + (10.1007/978-3-030-81685-8_42)
• Nested Sequents for Intuitionistic Modal Logics via Structural Refinement  + (10.1007/978-3-030-86059-2_24)
• A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic  + (10.1007/978-3-030-86205-3_1)
• Probabilistic Causes in Markov Chains  + (10.1007/978-3-030-88885-5_14)
• Determinization and Limit-Determinization of Emerson-Lei Automata  + (10.1007/978-3-030-88885-5_2)
• Be lazy and don’t care: Faster CTL model checking for recursive state machines  + (10.1007/978-3-030-92124-8_19)
• On probability-raising causality in Markov decision processes  + (10.1007/978-3-030-99253-8_3)
• A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic  + (10.1007/978-3-030-99524-9)
• Operational Causality - Necessarily Sufficient and Sufficiently Necessary  + (10.1007/978-3-031-15629-8_2)
• A Practical Account into Counting Dung’s Extensions by Dynamic Programming  + (10.1007/978-3-031-15707-3\_30)
• Representing Abstract Dialectical Frameworks with Binary Decision Diagrams  + (10.1007/978-3-031-15707-3_14)
• Efficient Dependency Analysis for Rule-Based Ontologies  + (10.1007/978-3-031-19433-7_16)
• An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog  + (10.1007/978-3-031-21541-4_10)
• Semantic Characterizations of AGM Revision for Tarskian Logics  + (10.1007/978-3-031-21541-4_7)
• On the Foundations of Cycles in Bayesian Networks  + (10.1007/978-3-031-22337-2_17)
• Effectiveness of Pre-computed Knowledge in Self-adaptation - A Robustness Study  + (10.1007/978-3-031-25049-1_2)
• Strategy Synthesis in Markov Decision Processes Under Limited Sampling Access  + (10.1007/978-3-031-33170-1_6)
• Nested Sequents for Quantified Modal Logics  + (10.1007/978-3-031-43513-3_24)
• Logics in Artificial Intelligence - 18th European Conference, JELIA 2023, Dresden, Germany, September 20-22, 2023, Proceedings  + (10.1007/978-3-031-43619-2)
• Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis  + (10.1007/978-3-031-43619-2_13)
• Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features  + (10.1007/978-3-031-43619-2_21)
• Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets  + (10.1007/978-3-031-43619-2_26)