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

• Approximation and Difference in Description Logics  + (203-214)
• Weighted Symbolic Automata with Data Storage  + (203-215)
• On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets  + (203-219)
• Probabilistic Causes in Markov Chains  + (205--221)
• The Well-Founded Semantics is a Stratified Fitting Semantics  + (205-221)
• The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion  + (205-–214)
• Managing Structured and Semistructured RDF Data Using Structure Indexes  + (2076-2089)
• Solving Hidokus using SAT Solvers  + (208-212)
• User Adaptation in a Web Shop System  + (208-213)
• Visualization of Statistical Information in Concept Lattice Diagrams  + (208-223)
• Model Checking Markov Chains with Actions and State Labels  + (209--224)
• Checking Equivalence for Reo Networks  + (209--226)
• A formal assessment result for fluent calculus using the action description language A_k  + (209-223)
• An Approach to Exploring Description Logic Knowledge Bases  + (209-224)
• A Correspondence between Temporal Description Logics  + (209-233)
• The Fuzzy Linguistic Description Logic ALC_FL  + (2096-2103)
• Configuring BDD Compilation Techniques for Feature Models  + (209–216)
• CLAS – A Parallel SAT Solver that Combines CDCL, Look-Ahead and SLS Search Strategies  + (21)
• Synthesis of Reo circuits from scenario-based specifications  + (21--41)
• Fusions of Description Logics  + (21-30)
• Temporal Conjunctive Queries in Expressive Description Logics with Transitive Roles  + (21-33)
• A Medvedev Characterization of Recognizable Tree Series  + (210-221)
• LODifier: Generating Linked Data from Unstructured Text  + (210-224)
• Unification in Varieties of Completely Regular Semigroups  + (210-230)
• Faceted Answer-Set Navigation  + (211--225)

• Clause Simplifications in Search-Space Decomposition-Based SAT Solvers  + (211-219)

• Distributed Splicing of RE with 6 Test Tubes  + (211-234)
• Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures  + (211-243)
• Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness  + (212--227)
• Matching under Side Conditions in Description Logics  + (213-218)
• Mary likes all Cats  + (213-226)
• On the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics  + (213-265)
• MELL in the Calculus of Structures  + (213-285)
• On the Complexity of Boolean Unification  + (215-220)
• Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata  + (217--226)
• Rare-Event Verification for Stochastic Hybrid Systems  + (217--226)
• Trees and Semantics  + (217--250)
• IASCAR: Incremental Answer Set Counting by Anytime Refinement  + (217-230)
• Unification in a Description Logic with Transitive Closure of Roles  + (217-232)
• Foundations of instance level updates in expressive description logics  + (2170-2197)
• A Description Logic of Change  + (218-223)
• Order matters! Harnessing a world of orderings for reasoning over massive data  + (219-231)
• The Fixed-Point Theorems of Priess-Crampe and Ribenboim in Logic Programming  + (219-235)
• Exploring Faulty Data  + (219-235)
• A Decidable Multi-agent Logic for Reasoning About Actions, Instruments, and Norms  + (219-241)
• Extensions to Description Logics  + (219-261)
• ProbMela and verification of Markov decision processes  + (22--27)
• ProbMeLa and Verification of Markov Decision Processes  + (22--27)
• Simulating perfect channels with probabilistic lossy channels  + (22--40)
• Matching with respect to general concept inclusions in the Description Logic EL  + (22-26)
• The Integration of Connectionism and First-Order Knowledge Representation and Reasoning as a Challenge for Artificial Intelligence  + (22-33)