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

• Denotational Semantics in the CPO and Metric Approach  + (171--220)
• Reasoning in ALC with Fuzzy Concrete Domains  + (171-182)
• Probabilistic Models for Reo Connector Circuits  + (1718--1748)
• All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs  + (1719--1725)
• A compact fuzzy extension of the Naive Bayesian classification algorithm  + (172-177)
• Are Fuzzy Description Logics with General Concept Inclusion Axioms Decidable?  + (1735-1742)
• On the expressiveness of MTL and TPTL over omega-data words  + (174--187)
• Deciding the Word Problem in the Union of Equational Theories Sharing Constructors  + (175-189)
• A Modified Supervaluationist Framework for Decision-Making  + (175-191)
• Using Automata Theory for Characterizing the Semantics of Terminological Cycles  + (175-219)
• Knowledge-Based Support for Scholarly Editing and Text Processing  + (176-179)
• Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis  + (176-191)
• A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL  + (177-188)
• SAT-Based Analysis and Quantification of Information Flow in Programs  + (177-192)
• Complexity of Universality and Related Problems for Partially Ordered NFAs  + (177-192)
• Representing Abstract Dialectical Frameworks with Binary Decision Diagrams  + (177-198)
• Concept Logic  + (177-201)
• Rewriting the Description Logic ALCHIQ to Disjunctive Existential Rules  + (1777-1783)
• Weighted Abstract Dialectical Frameworks  + (1779--1786)
• Gradual Learning of Matrix-Space Models of Language for Sentiment Analysis  + (178-185)
• Probabilistic and Topological Semantics for Timed Automata  + (179--191)
• Exploiting forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment  + (179--193)
• Advances in probabilistic model checking with PRISM: variable reordering, quantiles and weak deterministic Büchi automata  + (179--194)
• The Complexity of Conjunctive Query Answering in Expressive Description Logics  + (179-193)
• Formal Properties of Modularisation  + (179-193)

• Semantik, Web, Metadaten und digitale Edition: Grundlagen und Ziele der Erschließung neuer Quellen des Branitzer Pückler-Archivs  + (179-202)

• A note on C2 interpreted over finite data-words  + (17:1--17:14)
• Leveraging Non-Lexical Knowledge for the Linked Open Data Web  + (18-27)
• A New n-ary Existential Quantifier in Description Logics  + (18-33)
• LTL to Deterministic Emerson-Lei Automata  + (180--194)
• Probabilistic Model Checking for Feature-oriented Systems  + (180--220)
• Rushing and Strolling among Answer Sets – Navigation Made Easy (Extended Abstract)  + (181-184)
• LATPub437  + (181-190)
• Regulated Nondeterminism in PDAs: The Non-Regular Case  + (181-194)
• Verification of Golog Programs over Description Logic Actions  + (181-196)
• Complexity of Terminological Reasoning Revisited  + (181-200)
• Hierarchical control with partial observations: Sufficient conditions  + (1817-1822)
• Experiments with deterministic $ømega$-automata for formulas of linear temporal logic  + (182--195)
• Operational Semantics for a Fuzzy Logic Programming System with Defaults and Constructive Answers  + (1827--1832)
• Finite Groundings for ASP with Functions: A Journey through Consistency (Extended Abstract)  + (183-186)
• Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvemen  + (183-192)
• A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics  + (183-197)
• Alternating-Time Stream Logic for Multi-agent Systems  + (184--198)
• Justifications for the Description Logics Knowledge Bases under the Fixed-Domain Semantics  + (185--200)
• Deciding Bisimilarity and Similarity for Probabilistic Processes  + (187--231)
• Did I Damage my Ontology? A Case for Conservative Extensions in Description Logics  + (187-197)
• Conservative Extensions in Modal Logics  + (187-207)
• Generalized Metrics and Uniquely Determined Logic Programs  + (187-219)
• A Deduction Calculus for Cumulated Clauses on FLE Concept Descriptions  + (188 - 201)
• Towards a Formal Account on Negative Latency  + (188--214)
• A new context-based -subsumption algorithm  + (188-191)