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

• Symbolic Reasoning with Weighted and Normalized Decision Diagrams  + (10.1016/J.ENTCS.2005.11.022)
• Symbolic model checking for channel-based component connectors  + (10.1016/J.ENTCS.2007.03.003)
• Checking Equivalence for Reo Networks  + (10.1016/J.ENTCS.2008.06.029)
• Synthesis of Reo circuits from scenario-based specifications  + (10.1016/J.ENTCS.2009.06.027)
• Simulating perfect channels with probabilistic lossy channels  + (10.1016/J.IC.2004.12.001)
• Comparative branching-time semantics for Markov chains  + (10.1016/J.IC.2005.03.001)
• A note on the attractor-property of infinite-state Markov chains  + (10.1016/J.IPL.2005.09.011)
• Modeling component connectors in Reo by constraint automata  + (10.1016/J.SCICO.2005.10.008)
• Symbolic model checking for channel-based component connectors  + (10.1016/J.SCICO.2008.09.020)
• Alternating-time stream logic for multi-agent systems  + (10.1016/J.SCICO.2009.07.007)
• Synthesis of Reo circuits from scenario-based interaction specifications  + (10.1016/J.SCICO.2010.03.002)
• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes  + (10.1016/J.TCS.2005.07.022)
• Experiments with deterministic $ømega$-automata for formulas of linear temporal logic  + (10.1016/J.TCS.2006.07.022)
• On the Verification of Qualitative Properties of Probabilistic Processes under Fairness Constraints  + (10.1016/S0020-0190(98)00038-6)
• Trees and Semantics  + (10.1016/S0304-3975(96)00107-7)
• Metric Completion versus Ideal Completion  + (10.1016/S0304-3975(96)80705-5)
• Metric semantics for true concurrent real time  + (10.1016/S0304-3975(99)00342-4)
• Domain equations for probabilistic processes  + (10.1016/S1571-0661(05)80465-7)
• On the Semantic Foundations of Probabilistic Synchronous Reactive Programs  + (10.1016/S1571-0661(05)80594-8)
• Computing Probability Bounds for Linear Time Formulas over Concurrent Probabilistic Systems  + (10.1016/S1571-0661(05)80595-X)
• Approximating Operators and Semantics for Abstract Dialectical Frameworks  + (10.1016/j.artint.2013.09.004)
• (Non-)Succinctness of uniform interpolants of general terminologies in the description logic ℰℒ  + (10.1016/j.artint.2014.06.005)
• Methods for Solving Reasoning Problems in Abstract Argumentation – A Survey  + (10.1016/j.artint.2014.11.008)
• Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory  + (10.1016/j.artint.2015.05.003)
• On rejected arguments and implicit conflicts: The hidden power of argumentation semantics  + (10.1016/j.artint.2016.09.004)

• Reactive multi-context systems: Heterogeneous reasoning in dynamic environments  + (10.1016/j.artint.2017.11.007)

• Design and results of the second international competition on computational models of argumentation  + (10.1016/j.artint.2019.103193)
• Supervisory control synthesis of discrete-event systems using a coordination scheme  + (10.1016/j.automatica.2011.07.008)
• A note on controllability of deterministic context-free systems  + (10.1016/j.automatica.2012.06.004)
• Computing Intensional Answers to Questions - An Inductive Logic Programming Approach  + (10.1016/j.datak.2009.10.008)
• The classification of homomorphism homogeneous tournaments  + (10.1016/j.ejc.2020.103142)
• Next directions in experimental data for seismic hazard mitigation  + (10.1016/j.engstruct.2016.12.012)
• Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract)  + (10.1016/j.entcs.2004.04.028)
• Credo Methodology: Modeling and Analyzing a Peer-to-Peer System in Credo  + (10.1016/j.entcs.2010.08.047)
• Reasoning in fuzzy description logics using automata  + (10.1016/j.fss.2015.07.013)
• Neural Machine Translating from Natural Language to SPARQL  + (10.1016/j.future.2020.12.013)
• On the complexity of entailment in existential conjunctive first-order logic with atomic negation  + (10.1016/j.ic.2012.03.001)
• Complexity of Universality and Related Problems for Partially Ordered NFAs  + (10.1016/j.ic.2017.06.004)
• Algorithms for Reasoning in Very Expressive Description Logics under Infinitely Valued Gödel Semantics  + (10.1016/j.ijar.2016.12.014)
• EMIL: Extracting Meaning from Inconsistent Language: Towards argumentation using a controlled natural language interface  + (10.1016/j.ijar.2019.04.010)
• Concept lattices with negative information: A characterization theorem  + (10.1016/j.ins.2016.06.015)
• Probabilistic weak simulation is decidable in polynomial time  + (10.1016/j.ipl.2003.10.001)
• Descriptional complexity of semi-conditional grammars  + (10.1016/j.ipl.2007.05.002)
• Descriptional complexity of multi-parallel grammars  + (10.1016/j.ipl.2008.04.002)
• Model Checking Probabilistic Systems Against Pushdown Specifications  + (10.1016/j.ipl.2012.01.006)
• Statistical EL is ExpTime-complete  + (10.1016/j.ipl.2021.106113)
• A general first-order solution to the ramification problem with cycles  + (10.1016/j.jal.2013.05.003)
• Simple restriction in context-free rewriting  + (10.1016/j.jcss.2010.04.001)
• On restricted context-free grammars  + (10.1016/j.jcss.2011.05.008)
• Locks: Picking key methods for a scalable quantitative analysis  + (10.1016/j.jcss.2014.06.004)
• Satisfiability of ECTL* with Constraints  + (10.1016/j.jcss.2016.02.002)