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 model checking techniques for randomized distributed systems  + (1--11)

• Why propositional quantification makes modal logics on trees robustly hard ?  + (1--13)
• Stochastic Reasoning About Channel-Based Component Connectors  + (1--15)
• News on Temporal Conjunctive Queries  + (1--16)
• A Glimpse on Gerhard Brewka's Contributions to Artificial Intelligence  + (1--16)
• Norm Functions for Probabilistic Bisimulations with Delays  + (1--16)
• Probabilistic Model Checking and Non-standard Multi-objective Reasoning  + (1--16)
• Certificates and Witnesses for Multi-objective Queries in Markov Decision Processes  + (1--18)
• Genetic Algorithms for the Variable Ordering Problem of Binary Decision Diagrams  + (1--20)
• Synthesis of Reo Connectors for Strategies and Controllers  + (1--20)
• Performability assessment by model checking of Markov reward models  + (1--36)
• RFuzzy---A Framework for Multi-adjoint Fuzzy Logic Programming  + (1--6)
• Reasoning About Cost-Utility Constraints in Probabilistic Models  + (1--6)
• Stochastic Timed Automata  + (1--73)
• Design and Evaluation of Parallel Hashing over Large-scale Data  + (1-10)
• Towards Building Ontologies with the Wisdom of the Crowd  + (1-11)
• The Core Method: Connectionist Model Generation  + (1-13)
• On Logics and Homomorphism Closure  + (1-13)
• Finite Model Theory of the Triguarded Fragment and Related Logics  + (1-13)
• Long-run Satisfaction of Path Properties  + (1-14)
• Responsibility and verification: Importance value in temporal logics  + (1-14)
• A Modularization-based Approach to Finding All Justifications for OWL DL Entailments  + (1-15)
• Probabilistic Query Answering in the Bayesian Description Logic BEL  + (1-15)
• Decision making improves sperm chemotaxis in the presence of noise  + (1-15)
• On SAT-Encodings of the At-Most-One Constraint  + (1-17)
• On SAT-Encodings of the At-Most-One Constraint  + (1-17)
• On the Expressivity of Feature Logics with Negation, Functional Uncertainty, and Sort Equations  + (1-18)
• Tableau Algorithms for Description Logics  + (1-18)
• Robust mobile robot localisation from sparse and noisy proximity readings using Hough transform and probability grids  + (1-18)
• The Complexity of Lattice-Based Fuzzy Description Logics  + (1-19)
• Towards next generation sequential and parallel SAT solvers  + (1-2)
• Usability Issues in Description Logic Knowledge Base Completion  + (1-21)
• P ≠ P: Why Some Reasoning Problems Are More Tractable Than Others  + (1-22)
• Automata-Theoretic Decision Procedures for Information Logics  + (1-22)
• Description Logics That Count, and What They Can and Cannot Count  + (1-25)
• Topological Entropy of Formal Languages  + (1-26)
• Reasoning and Explanation in EL and in Expressive Description Logics  + (1-27)
• Fast algorithms for implication bases and attribute exploration using proper premises  + (1-29)
• Display to Labeled Proofs and Back Again for Tense Logics  + (1-31)
• From Tableaux to Automata for Description Logics  + (1-32)
• From Tableaux to Automata for Description Logics  + (1-33)
• Lazy model checking for recursive state machines  + (1-33)
• On Language Equations with One-sided Concatenation  + (1-35)
• Description Logics  + (1-39)
• Rational Models of Normal Logic Programs  + (1-4)
• Compositional matrix-space models of language: Definitions, properties, and learning methods  + (1-49)
• Fusions of Description Logics and Abstract Description Systems  + (1-58)
• Cognitive Science, Computational Logic and Connectionism  + (1-6)