Search by property

This page provides a simple browsing interface for finding entities described by a property and a named value. Other available search interfaces include the page property search, and the ask query builder.

List of results

• On the State Complexity of the Reverse of R- and J-Trivial Regular Languages  + (Jirásková)
• On a structural property in the state complexity of projected regular languages  + (Jirásková)
• On Properties and State Complexity of Deterministic State-Partition Automata  + (Jirásková)
• On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs  + (Jirásková)
• Complexity in Union-Free Regular Languages  + (Jirásková)
• Complexity in Union-Free Regular Languages  + (Jirásková)
• State Complexity of Projected Languages  + (Jirásková)
• Estrategias de combinación de recursos lexicográficos en la adquisición de lenguas extranjeras (en contextos específicos)  + (Johannes)
• Determinization and Limit-Determinization of Emerson-Lei Automata  + (John)
• From Emerson-Lei Automata to Deterministic, Limit-Deterministic or Good-for-MDP Automata  + (John)
• Multimodality in Mobile Computing and Mobile Devices: Methods for Adaptable Usability  + (Kadner)
• A formal assessment result for fluent calculus using the action description language A_k  + (Kahramanogullari)
• Nondeterminism and Language Design in Deep Inference  + (Kahramanogullari)
• Plans as Formulae with a Non-commutative Logical Operator - Planning as Concurrency  + (Kahramanoğulları)
• System BV is NP-complete  + (Kahramanoğulları)
• Reducing Nondeterminism in the Calculus of Structures  + (Kahramanoğulları)
• Implementing System BV of the Calculus of Structures in Maude  + (Kahramanoğulları)
• Towards Planning as Concurrency  + (Kahramanoğulları)
• System BV without the Equalities for Unit  + (Kahramanoğulları)
• Implementing Deep Inference in TOM  + (Kahramanoğulları)
• Rekurrente Neuronale Netze zur Approximation der Semantik akzeptabler logischer Programme  + (Kalinke)
• Using Connectionist Term Representations for First-Order-Deduction- A Critical View  + (Kalinke)
• Approximation der Funktion Tp normaler logischer Programme P durch 3-schichtige vorwärtsgerichtete Netze  + (Kalinke)
• Detecting Synonymous Properties by Shared Data-driven Definitions  + (Kalo)
• Mona as a DL Reasoner  + (Karabaev)
• FCPlanner: A Planning Strategy for First-Order MDPs  + (Karabaev)
• Efficient Symbolic Reasoning for First-Order MDPs  + (Karabaev)
• A Heuristic Search Algorithm for Solving First-Order MDPs  + (Karabaev)

• A Modified Supervaluationist Framework for Decision-Making  + (Karge)
• Second-order Confidence in Supervaluationism  + (Karge)
• Taming Dilation in Imprecise Pooling  + (Karge)
• The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion  + (Karge)
• To Lead or to be Led: A Generalized Condorcet Jury Theorem under Dependence  + (Karge)
• Voting for Bins: Integrating Imprecise Probabilistic Beliefs into the Condorcet Jury Theorem  + (Karge)

• Metric semantics for true concurrent real time  + (Katoen)
• The Incredible ELK: From Polynomial Procedures to Efficient Reasoning with ℰℒ Ontologies  + (Kazakov)
• Practical Reasoning with Nominals in the EL Family of Description Logics  + (Kazakov)
• ELK Reasoner: Architecture and Evaluation  + (Kazakov)
• Unchain My EL Reasoner  + (Kazakov)
• Concurrent Classification of EL Ontologies  + (Kazakov)
• Anomaly-Driven Concept Acquisition  + (Kennedy)
• A Conceptual Foundation for Autonomous Learning in Unforeseen Situations  + (Kennedy)
• Evolution of Self-Definition  + (Kennedy)
• UniMoK: A System for Combining Equational Unification Algorithms  + (Kepser)
• Optimisation Techniques for Combining Constraint Solvers  + (Kepser)
• Optimisation Techniques for Combining Constraint Solvers  + (Kepser)
• Finite Model Theory of the Triguarded Fragment and Related Logics  + (Kieroński)
• Semantik, Linked Data, Web-Präsentation: Grundlagen der Nachlasserschließung im Portal www.pueckler-digital.de  + (Kittelmann)
• Semantik, Web, Metadaten und digitale Edition: Grundlagen und Ziele der Erschließung neuer Quellen des Branitzer Pückler-Archivs  + (Kittelmann)
• Knowledge-Based Support for Scholarly Editing and Text Processing  + (Kittelmann)
• Towards Knowledge-Based Assistance for Scholarly Editing  + (Kittelmann)
• Semantik, Linked Data, Web-Präsentation: Grundlagen der Nachlasserschließung im Portal www.pueckler-digital.de  + (Kittelmann)
• SAT-Based Analysis and Quantification of Information Flow in Programs  + (Klebanov)
• Compositional Synthesis and Most General Controllers  + (Klein)
• Experiments with Deterministic $ømega$-Automata for Formulas of Linear temporal Logic  + (Klein)
• Experiments with deterministic $ømega$-automata for formulas of linear temporal logic  + (Klein)