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

• Description Logics with Concrete Domains and Functional Dependencies  + (Lutz)
• Quantitative Temporal Logics: PSpace and below  + (Lutz)
• A Tableau Algorithm for DLs with Concrete Domains and GCIs  + (Lutz)
• Complexity and Succinctness of Public Announcement Logic  + (Lutz)
• PDL with Intersection and Converse is Decidable  + (Lutz)
• The Basics of Display Calculi  + (Lyon)
• From Display to Labelled Proofs for Tense Logics  + (Lyon)
• Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics  + (Lyon)
• Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents  + (Lyon)
• On the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics  + (Lyon)
• Refining Labelled Systems for Modal and Constructive Logics with Applications  + (Lyon)
• Nested Sequents for Intuitionistic Modal Logics via Structural Refinement  + (Lyon)
• A Framework for Intuitionistic Grammar Logics  + (Lyon)
• Automating Reasoning with Standpoint Logic via Nested Sequents  + (Lyon)
• Uniform and Modular Sequent Systems for Description Logics  + (Lyon)
• Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules  + (Lyon)
• Nested Sequents for Intermediate Logics: The Case of Gödel-Dummett Logics  + (Lyon)
• Nested Sequents for Quantified Modal Logics  + (Lyon)
• Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets  + (Lyon)
• Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents  + (Lyon)
• Proof Theory and Decision Procedures for Deontic STIT Logics  + (Lyon)
• Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents  + (Lyon)
• Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations  + (Lyon)
• On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic  + (Lyon)
• Internal and External Calculi: Ordering the Jungle without Being Lost in Translations  + (Lyon)

• Propositional Dynamic Logic with Recursive Programs  + (Löding)

• Tempus Fugit - Towards an Ontology Update Language  + (Lösch)
• High Quality Data Generation: An Ontology Reasoning based Approach  + (Ma)
• Semantic Annotation in Specific Domains with rich Ontologies (in French)  + (Ma)
• Concept Adjustment for Description Logics  + (Ma)
• Learning Formal Definitions for Snomed CT from Text  + (Ma)
• Measuring Incompleteness under Multi-Valued Semantics by Partial MaxSAT Solvers  + (Ma)
• Towards Parallel Repair: An Ontology Decomposition-based Approach  + (Ma)
• Learning Formal Definitions for Snomed CT from Text  + (Ma)
• Towards Parallel Repair Using Decompositions  + (Ma)
• Image Schemas and Conceptual Dependency Primitives: A Comparison  + (Macbeth)
• A rule-based ontological framework for the classification of molecules  + (Magka)
• Nonmonotonic Existential Rules for Non-Tree-Shaped Ontological Modelling  + (Magka)
• Computing Stable Models for Nonmonotonic Existential Rules  + (Magka)
• Paraconsistent OWL and Related Logics  + (Maier)
• Employing DL-LiteR-Reasoners for Fuzzy Query Answering  + (Mailis)
• Conjunctive Query Answering in Finitely-valued Fuzzy Description Logics  + (Mailis)
• Metric completion versus ideal completion  + (Majster-Cederbaum)
• Metric Completion versus Ideal Completion  + (Majster-Cederbaum)
• Getting the Most out of Wikidata: Semantic Technology Usage in Wikipedia’s Knowledge Graph  + (Malyshev)
• A framework for connection calculi  + (Mantel)
• Towards Next Generation Sequential and Parallel SAT Solvers  + (Manthey)
• The SAT Solver Framework priss (System Description)  + (Manthey)
• Soundness of Inprocessing in Clause Sharing SAT Solvers  + (Manthey)
• Solver submission of riss 1.0 to the SAT Competition 2011  + (Manthey)
• CDCL Solver Additions: Local Look-ahead, All-Unit-UIP Learning and On-the-fly Probing  + (Manthey)