On the public citation graph
The Learnability of Description Logics with Equality Constraints
0 signed · 102 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/bs.3830120511openalex-snapshot
Word concepts: A theory and simulation of some basic semantic capabilities
inferredcites →https://doi.org/10.1007/3-540-56483-7_21openalex-snapshot
Cryptographic limitations on learning Boolean formulae and finite automata
inferredcites →https://doi.org/10.1007/3-540-56602-3_131openalex-snapshot
Some lower bounds for the computational complexity of inductive logic programming
inferredcites →https://doi.org/10.1007/978-1-4613-1557-5openalex-snapshot
Incremental Version-Space Merging: A General Framework for Concept Learning
inferredcites →https://doi.org/10.1007/978-1-4613-1557-5_2openalex-snapshot
Incremental Version-Space Merging
inferredcites →https://doi.org/10.1007/978-3-642-74688-8_22openalex-snapshot
Variant Construction Using Constraint Propagation Techniques Over Semantic Networks
inferredcites →https://doi.org/10.1007/978-3-662-12405-5_3openalex-snapshot
A COMPARATIVE REVIEW OF SELECTED METHODS FOR LEARNING FROM EXAMPLES
inferredcites →https://doi.org/10.1007/bf00114802openalex-snapshot
Learning Conjunctive Concepts in Structural Domains
inferredcites →https://doi.org/10.1007/bf00117105openalex-snapshot
Learning Logical Definitions from Relations
inferredcites →https://doi.org/10.1007/bf00994112openalex-snapshot
Learning boolean functions in an infinite attribute space
inferredcites →https://doi.org/10.1016/0004-3702(88)90001-xopenalex-snapshot
Generalized subsumption and its applications to induction and redundancy
inferredcites →https://doi.org/10.1016/0022-0000(90)90028-jopenalex-snapshot
Prediction-preserving reducibility
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1016/b978-0-86576-091-2.50009-5openalex-snapshot
Learning and Inductive Inference
inferredcites →https://doi.org/10.1016/b978-0-934613-41-5.50037-4openalex-snapshot
Recent Results on Boolean Concept Learning
inferredcites →https://doi.org/10.1016/b978-0-934613-64-4.50040-2openalex-snapshot
Machine Invention of First-order Predicates by Inverting Resolution
inferredcites →https://doi.org/10.1016/b978-1-4832-0771-1.50021-7openalex-snapshot
THE EVOLVING TECHNOLOGY OF CLASSIFICATION-BASED KNOWLEDGE REPRESENTATION SYSTEMS
inferredcites →https://doi.org/10.1016/b978-1-4832-1446-7.50018-2openalex-snapshot
A FRAMEWORK FOR REPRESENTING KNOWLEDGE
inferredcites →https://doi.org/10.1016/b978-1-55860-036-2.50132-6openalex-snapshot
A BOOTSTRAPPING APPROACH TO CONCEPTUAL CLUSTERING
inferredcites →https://doi.org/10.1016/b978-1-55860-200-7.50088-xopenalex-snapshot
Learning Constrained Atoms
inferredcites →https://doi.org/10.1016/b978-1-55860-247-2.50019-xopenalex-snapshot
Spatial analogy and subsumption
inferredcites →https://doi.org/10.1016/b978-1-55860-307-3.50026-5openalex-snapshot
Generalization under Implication by Recursive Anti-unification
inferredcites →https://doi.org/10.1016/c2013-0-07691-8openalex-snapshot
The Handbook of Artificial Intelligence
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1016/s0364-0213(77)80003-7openalex-snapshot
An Overview of KRL, a Knowledge Representation Language
inferredcites →https://doi.org/10.1023/a:1022696716689openalex-snapshot
Learning Nested Differences of Intersection-Closed Concept Classes
inferredcites →https://doi.org/10.1023/a:1022869011914openalex-snapshot
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
inferredcites →https://doi.org/10.1109/icde.1989.47264openalex-snapshot
Classification as a query processing technique in the CANDIDE semantic data model
inferredcites →https://doi.org/10.1109/lics.1991.151632openalex-snapshot
Unification and anti-unification in the calculus of constructions
inferredcites →https://doi.org/10.1109/mex.1987.4307092openalex-snapshot
Organizing Knowledge in a Complex Financial Domain
inferredcites →https://doi.org/10.1109/sfcs.1987.37openalex-snapshot
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
inferredcites →https://doi.org/10.1145/100216.100224openalex-snapshot
Learning boolean functions in an infinite attribute space
inferredcites →https://doi.org/10.1145/12130.12158openalex-snapshot
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1145/130385.130399openalex-snapshot
PAC-learnability of determinate logic programs
inferredcites →https://doi.org/10.1145/174644.174647openalex-snapshot
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
inferredcites →https://doi.org/10.1145/48014.63140openalex-snapshot
Computational limitations on learning from examples
inferredcites →https://doi.org/10.1145/73007.73049openalex-snapshot
Crytographic limitations on learning Boolean formulae and finite automata
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1613/jair.56openalex-snapshot
A Semantics and Complete Algorithm for Subsumption in the CLASSIC Description Logic
inferredcites →https://doi.org/10.5555/93025.93100openalex-snapshot
Learning theories in a subset of a polyadic logic
inferredcites →https://doi.org/10.7551/mitpress/1192.001.0001openalex-snapshot
Algorithmic Program Debugging
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470588222.ch8openalex-snapshot
Machine Learning Methods for Ontology Mining
inferred← citeshttps://doi.org/10.1007/11504894_53openalex-snapshot
An Algorithm Based on Counterfactuals for Concept Learning in the Semantic Web
inferred← citeshttps://doi.org/10.1007/11558590_41openalex-snapshot
A Counterfactual-Based Learning Algorithm for $\mathcal{ALC}$ Description Logic
inferred← citeshttps://doi.org/10.1007/11811220_7openalex-snapshot
Building Conceptual Knowledge for Managing Learning Paths in e-Learning
inferred← citeshttps://doi.org/10.1007/3-540-36182-0_32openalex-snapshot
Discovery of Maximal Analogies between Stories
inferred← citeshttps://doi.org/10.1007/3-540-36468-4_3openalex-snapshot
Learning with Feature Description Logics
inferred← citeshttps://doi.org/10.1007/3-540-36468-4_8openalex-snapshot
Learnability of Description Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-40992-0_13openalex-snapshot
Conceptual Classifications Guided by a Concept Hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-44960-4_12openalex-snapshot
Towards Learning in CARIN-ALN
inferred← citeshttps://doi.org/10.1007/3-540-45049-1_57openalex-snapshot
A Least Common Subsumer Operation for an Expressive Description Logic
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_13openalex-snapshot
Explicity Using Default Knowledge in Concept Learning: An Extended Description Logics Plus Strict and Default Rules
inferred← citeshttps://doi.org/10.1007/3-540-46695-9_19openalex-snapshot
Computing Least Common Subsumers in Expressive Description Logics
inferred← citeshttps://doi.org/10.1007/3-540-60343-3_30openalex-snapshot
Quality-based terminological reasoning for concept learning
inferred← citeshttps://doi.org/10.1007/3-540-60428-6_1openalex-snapshot
Terminological meta-reasoning by reification and multiple contexts
inferred← citeshttps://doi.org/10.1007/3-540-60925-3_66openalex-snapshot
Learning from texts — A terminological metareasoning perspective
inferred← citeshttps://doi.org/10.1007/3-540-61286-6_132openalex-snapshot
Learning composite concepts in description logics: A first step
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_36openalex-snapshot
On exploiting knowledge and concept use in learning theory
inferred← citeshttps://doi.org/10.1007/978-3-319-03524-6_30openalex-snapshot
Common Subsumbers in RDF
inferred← citeshttps://doi.org/10.1007/978-3-319-40566-7_6openalex-snapshot
Ontology Learning from Interpretations in Lightweight Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-32279-5_17openalex-snapshot
Towards Constructing Story Databases Using Maximal Analogies Between Stories
inferred← citeshttps://doi.org/10.1007/978-3-540-36562-4_48openalex-snapshot
Ontology Learning from Text: Tasks and Challenges for Machine Learning (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-45092-4_5openalex-snapshot
Agents Based Ontological Mediation in IE Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_14openalex-snapshot
Matching in Hybrid Terminologies
inferred← citeshttps://doi.org/10.1007/978-3-642-38812-5_11openalex-snapshot
A Declarative Modeling Language for Concept Learning in Description Logics
inferred← citeshttps://doi.org/10.1007/b104697openalex-snapshot
Intuitive human interfaces for organizing and accessing intellectual assets : International Workshop, Dagstuhl Castle, Germany, March 1-5, 2004 : revised selected papers
inferred← citeshttps://doi.org/10.1007/bfb0095434openalex-snapshot
Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions
inferred← citeshttps://doi.org/10.1007/s10489-006-0011-5openalex-snapshot
An algorithm based on counterfactuals for concept learning in the Semantic Web
inferred← citeshttps://doi.org/10.1007/s11225-005-3705-5openalex-snapshot
Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions
inferred← citeshttps://doi.org/10.1016/j.dam.2019.11.006openalex-snapshot
Contribution to attributive and object subcontexts in inferring good maximally redundant tests
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00062-5openalex-snapshot
Learning logic programs with structured background knowledge☆☆An extended abstract of this paper appeared in: L. De Raedt (Ed.), Proceedings of the Fifth International Workshop on Inductive Logic Programming, Tokyo, Japan, 1995, pp. 53–76, Scientific Report of the Department of Computer Science,…
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00015-7openalex-snapshot
Learning unions of tree patterns using queries
inferred← citeshttps://doi.org/10.1023/a:1007406511732openalex-snapshot
Hardness Results for Learning First-Order Representations and Programming by Demonstration
inferred← citeshttps://doi.org/10.1111/j.1468-0394.2008.00461.xopenalex-snapshot
Approaches for semantic interoperability between domain ontologies
inferred← citeshttps://doi.org/10.1142/s0218194099000292openalex-snapshot
AUTOMATICALLY EXPLORING HYPOTHESES ABOUT FAULT PREDICTION: A COMPARATIVE STUDY OF INDUCTIVE LOGIC PROGRAMMING METHODS
inferred← citeshttps://doi.org/10.1145/180139.181170openalex-snapshot
Learning from a consistently ignorant teacher
inferred← citeshttps://doi.org/10.1145/238061.238066openalex-snapshot
The dual DFA learning problem (extended abstract)
inferred← citeshttps://doi.org/10.1145/267460.267468openalex-snapshot
Learning logic programs by using the product homomorphism method
inferred← citeshttps://doi.org/10.1145/279943.279978openalex-snapshot
Learning atomic formulas with prescribed properties
inferred← citeshttps://doi.org/10.15406/iratj.2018.04.00090openalex-snapshot
Resampling Imbalanced Class and the Effectiveness of Feature Selection Methods for Heart Failure Dataset
inferred← citeshttps://doi.org/10.1613/jair.1917openalex-snapshot
Pac-learning Recursive Logic Programs: Negative Results
inferred← citeshttps://doi.org/10.1613/jair.56openalex-snapshot
A Semantics and Complete Algorithm for Subsumption in the CLASSIC Description Logic
inferred← citeshttps://doi.org/10.1613/jair.702openalex-snapshot
What's in an Attribute? Consequences for the Least Common Subsumer
inferred← citeshttps://doi.org/10.21236/ada465320openalex-snapshot
Agent Communication with Differentiated Ontologies: Eight New Measures of Description Compatibility
inferred← citeshttps://doi.org/10.24963/ijcai.2023/373openalex-snapshot
SAT-Based PAC Learning of Description Logic Concepts
inferred← citeshttps://doi.org/10.25368/2022.175openalex-snapshot
Completion-based computation of least common subsumers with limited role-depth for EL and Prob-EL⁰¹
inferred← citeshttps://doi.org/10.25368/2022.82openalex-snapshot
Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions
inferred← citeshttps://doi.org/10.26092/elib/4210openalex-snapshot
Actively Learning ELI Queries under DL-Lite Ontologies
inferred← citeshttps://doi.org/10.3233/978-1-58603-891-5-739openalex-snapshot
Partial and Informative Common Subsumers in Description Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1906.10106openalex-snapshot
Implicitly Learning to Reason in First-Order Logic
inferred← citeshttps://doi.org/10.70675/7dec265fz8cdfz40b2zbb92z51969aaa33f0openalex-snapshot
On the enumeration of pseudo-intents : choosing the order and extending to partial implications
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.