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 Decidability Status of Fuzzy ALC with General Concept Inclusions  + (http://dx.doi.org/10.1007/s10992-014-9329-3)
• The Limits of Decidability in Fuzzy Description Logics with General Concept Inclusions  + (http://dx.doi.org/10.1016/j.artint.2014.09.001)
• Consistency Reasoning in Lattice-Based Fuzzy Description Logics  + (http://dx.doi.org/10.1016/j.ijar.2013.07.006)
• Completion-based Generalization Inferences for the Description Logic ELOR with Subjective Probabilities  + (http://dx.doi.org/10.1016/j.ijar.2014.03.001)
• Runtime Verification Using the Temporal Description Logic ALC-LTL Revisited  + (http://dx.doi.org/10.1016/j.jal.2014.09.001)
• Similarity-based Relaxed Instance Queries  + (http://dx.doi.org/10.1016/j.jal.2015.01.002)
• The Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees  + (http://dx.doi.org/10.1016/j.tcs.2014.02.036)
• Temporalizing Rewritable Query Languages over Knowledge Bases  + (http://dx.doi.org/10.1016/j.websem.2014.11.007)
• Temporal Query Entailment in the Description Logic SHQ  + (http://dx.doi.org/10.1016/j.websem.2014.11.008)
• Fuzzy Answer Sets Approximations  + (http://dx.doi.org/10.1017/S1471068413000471)
• Cost-Utility Analysis in Probabilistic Models  + (http://dx.doi.org/10.1109/TASE.2016.10)
• The Logical Difference for ELHr-Terminologies using Hypergraphs  + (http://dx.doi.org/10.3233/978-1-61499-419-0-555)
• Cut-Free Calculi and Relational Semantics for Temporal STIT Logics  + (https://doi.org/10.1007/978-3-030-19570-0_52)
• Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics  + (https://doi.org/10.1007/978-3-030-33792-6_13)
• A Decidable Multi-agent Logic for Reasoning About Actions, Instruments, and Norms  + (https://doi.org/10.1007/978-3-030-44638-3_14)
• A Framework for Intuitionistic Grammar Logics  + (https://doi.org/10.1007/978-3-030-89391-0_29)
• IASCAR: Incremental Answer Set Counting by Anytime Refinement  + (https://doi.org/10.1007/978-3-031-15707-3_17)
• Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy  + (https://doi.org/10.1007/978-3-031-15707-3_8)
• Towards Mass Spectrum Analysis with ASP  + (https://doi.org/10.1007/978-3-031-74209-5_16)
• Pushing the Boundaries of Tractable Ontology Reasoning.  + (https://doi.org/10.1007/978-3-319-11915-1_10)
• A Chomsky-Schützenberger Theorem for Weighted Automata with Storage  + (https://doi.org/10.1007/978-3-319-23021-4_11)
• A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem  + (https://doi.org/10.1007/978-3-319-30000-9_10)
• Linear Context-Free Tree Languages and Inverse Homomorphisms  + (https://doi.org/10.1007/978-3-319-30000-9_37)
• Rule-Based OWL Modeling with ROWLTab Protégé Plugin  + (https://doi.org/10.1007/978-3-319-58068-5_26)
• A Medvedev Characterization of Recognizable Tree Series  + (https://doi.org/10.1007/978-3-319-62809-7_15)

• From Display to Labelled Proofs for Tense Logics  + (https://doi.org/10.1007/978-3-319-72056-2_8)

• Recent Advances in Integrating OWL and Rules  + (https://doi.org/10.1007/978-3-642-33203-6_20)
• A cross-lingual correcting and completive method for multilingual ontology labels  + (https://doi.org/10.1007/978-3-662-43585-4)
• Weighted Symbolic Automata with Data Storage  + (https://doi.org/10.1007/978-3-662-53132-7_17)
• A Neutral Temporal Deontic STIT Logic  + (https://doi.org/10.1007/978-3-662-60292-8_25)
• Second-order Confidence in Supervaluationism  + (https://doi.org/10.1007/s10838-023-09652-7)
• A Logical Analysis of Instrumentality Judgments: Means-End Relations in the Context of Experience and Expectations  + (https://doi.org/10.1007/s10992-023-09714-7)
• An Abstract, Logical Approach to Characterizing Strong Equivalence in Non-monotonic Knowledge Representation Formalisms  + (https://doi.org/10.1016/j.artint.2022.103680)
• Preface: Concept Lattices and Applications: Recent Advances and New Opportunities  + (https://doi.org/10.1016/j.dam.2018.10.007)
• Weighted automata with storage  + (https://doi.org/10.1016/j.ic.2019.104447)
• Linear context-free tree languages and inverse homomorphisms  + (https://doi.org/10.1016/j.ic.2019.104454)
• Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination  + (https://doi.org/10.1016/j.ic.2019.104504)
• Linear weighted tree automata with storage and inverse linear tree homomorphisms  + (https://doi.org/10.1016/j.ic.2021.104816)
• Exact Learning of Multivalued Dependency Formulas  + (https://doi.org/10.1016/j.tcs.2017.11.018)
• IASCAR: Incremental Answer Set Counting by Anytime Refinement  + (https://doi.org/10.1017/S1471068424000036)
• Where do business students turn for help? An empirical study on dictionary use in foreign-language learning  + (https://doi.org/10.1093/ijl/ecv027)
• Chase Termination Beyond Polynomial Time  + (https://doi.org/10.1145/3651594)
• Answering Queries with Negation over Existential Rules  + (https://doi.org/10.1609/aaai.v36i5.20503)
• Rushing and Strolling among Answer Sets - Navigation Made Easy  + (https://doi.org/10.1609/aaai.v36i5.20506)
• Admissibility in Probabilistic Argumentation  + (https://doi.org/10.1613/jair.1.13530)
• How to Tell Easy from Hard: Complexities of Conjunctive Query Entailment in Extensions of ALC  + (https://doi.org/10.1613/jair.1.14482)
• Weighted Regular Tree Grammars with Storage  + (https://doi.org/10.23638/DMTCS-20-1-26)
• Navigating and Querying Answer Sets: How Hard Is It Really and Why?  + (https://doi.org/10.24963/kr.2024/60)
• Nemo: Your Friendly and Versatile Rule Reasoning Toolkit  + (https://doi.org/10.24963/kr.2024/70)
• Hashtag Processing for Enhanced Clustering of Tweets  + (https://doi.org/10.26615/978-954-452-049-6_038)
• Description Logics That Count, and What They Can and Cannot Count  + (https://doi.org/10.29007/ltzn)