A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Filters
Characterizing functional dependencies in formal concept analysis with pattern structures
2014
Annals of Mathematics and Artificial Intelligence
Preserved Fulltext
Whereas it has been deeply investigated in those fields, strong links exist with the mathematical framework of Formal Concept Analysis. ...
We also show how another class of dependencies can be characterized with that framework, namely, degenerated multivalued dependencies. ...
Acknowledgements This research work has been partially supported by the Spanish Ministry of Education and Science (project TIN2008-06582-C03-01), EU PASCAL2 Network of Excellence, and by the Generalitat ...
doi:10.1007/s10472-014-9400-3
fatcat:ckesjrsxe5fc5cvek5x35zondy
Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
2018
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We show that these dependencies can be formalized in the framework of Formal Concept Analysis (FCA) using a previous formalization introduced for standard FDs. ...
Our new results state that, starting from the conceptual structure of a pattern structure, and generalizing the notion of relation between tuples, approximate-matching dependencies can be characterized ...
This research work has been supported by the SGR2014-890 (MACDA) project of the Generalitat de Catalunya, and MINECO project APCOM (TIN2014-57226-P) and partially funded by the French National Project ...
doi:10.1016/j.dam.2018.03.073
fatcat:zomtrupnfrghlfg44s6zcaz4q4
Conceptual analysis of lexical taxonomies
2001
Proceedings of the international conference on Formal Ontology in Information Systems - FOIS '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Some principles from a forthcoming OntoClean methodology are applied to the ontological analysis of WordNet. ...
We shall integrate these tools with techniques derived from ONIONS project, whose original task was the development of a large-scale, axiomatized ontology library for medical terminology. ...
Acknowledgements We would like to thank Claudio Masolo, Chris Partridge, Domenico Pisanelli, and Geri Steve for the fruitful discussions and comments on the earlier version of this paper. ...
doi:10.1145/505168.505195
dblp:conf/fois/GangemiGO01
fatcat:q3ukv6fssnct7dn7mop3jefhia
Which Mathematical Logic is the Logic of Mathematics?
2012
Logica Universalis
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
History of Logic vs. History of Mathematics. Jaakko Hintikka. 032012 17 BIBLIOGRAPHY ...
Acknowledgements This paper was written when Jaakko Hintkkka was a Distinguished Visiting Fellow of the Collegium for Advanced Studies of the University of Helsinki. ...
But the most basic concepts of analysis involve dependent quantifiers. So how did Cauchy and his followers handle dependent quantifiers in defining notions like limit and convergence? ...
doi:10.1007/s11787-012-0065-6
fatcat:7egblszkrjg7lmnutjlz2igfqu
Towards a compiler analysis for parallel algorithmic skeletons
2018
Proceedings of the 27th International Conference on Compiler Construction - CC 2018
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we argue that commutativity is a more suitable concept supporting formal characterization of parallel algorithmic skeletons. ...
We show that existing commutativity definitions cannot be easily adapted for practical use, and develop a new concept of commutativity based on liveness, which readily integrates with existing compiler ...
Skeleton Characterization In the following paragraphs we are going to formally characterize a selection of widely used skeletons using the commutativity concept introduced in Definition 1. ...
doi:10.1145/3178372.3179513
dblp:conf/cc/KochMVCF18
fatcat:toa6gtu7ibheticjhphtxytmz4
Time Aware Knowledge Extraction for Microblog Summarization on Twitter
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This work defines Time Aware Knowledge Extraction (briefly TAKE) methodology that relies on temporal extension of Fuzzy Formal Concept Analysis. ...
In particular, a microblog summarization algorithm has been defined filtering the concepts organized by TAKE in a time-dependent hierarchy. ...
Acknowledgement The authors are indebted to the authors of [4] for the provisioning of tweet streams and gold summary in order to enable the comparison evaluation of the proposed framework. ...
arXiv:1501.06715v1
fatcat:7nxfrxin2fbkfmlyve4yqo6a7e
Page 393 of The South Atlantic Quarterly Vol. 53, Issue 3
[page]
1954
The South Atlantic Quarterly
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The unique quality of Faulkner’s typical syntax, as with other major features of his art, originates in his concept of reality and his penchant for minute analysis, with the multiplicity of a given moment ...
Physically they are often characterized by unusual length, by patterns of involuted dependent elements, clause modified by clause, by phrase, with dependencies as far removed, sometimes, as three and four ...
Fuzzy Concept Lattices Constrained by Hedges
2007
Journal of Advanced Computational Intelligence and Intelligent Informatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
As a consequence, we obtain a theorem characterizing the structure of concept lattices with hedges which generalizes the well-known main theorem of ordinary concept lattices. ...
We introduce new, parameterized, concept-forming operators and study their properties. We obtain an axiomatic characterization of the concept-forming operators. ...
Formal concept analysis deals with input data in the form of a table with rows corresponding to objects and columns corresponding to attributes which describes a relationship between the objects and attributes ...
doi:10.20965/jaciii.2007.p0536
fatcat:wusnmgfg7rf5vfqguhx3hs2zjq
Emergence in effective field theories
2013
European Journal for Philosophy of Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
This essay considers the extent to which a concept of emergence can be associated with Effective Field Theories (EFTs). ...
I suggest that such a concept can be characterized by microphysicalism and novelty underwritten by the elimination of degrees of freedom from a high-energy theory, and argue that this makes emergence in ...
Their scaling behavior can be determined by dimensional analysis with respect to L 0 . ...
doi:10.1007/s13194-013-0067-0
fatcat:tgwrj3wz6fgj7nvwt77efesluu
DEPONTO: A Reusable Dependability Domain Ontology
2015
TEM Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Thus, this paper gives an analysis of what is the dependability domain ontology andof its components.The dependability domain ontology plays an important role in ensuring the dependability of information ...
its reusability within this category of systems. ...
A formal ontology requires formal logic to define the concepts and uses a formal language like Description Logics (DL), Web Ontology Language (OWL), First Order Logic (FOL), and Conceptual Graphs (CG). ...
doaj:d34f0f55df3c4cf9a50a998d61f48d02
fatcat:znggibxpczcjneic2y2gf5i6by
Formal concept analysis with background knowledge: a case study in paleobiological taxonomy of belemnites
2013
International Journal of General Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Petr Osicka is a Member of ACM (Association for Computing Machinery). ...
Dr Osicka's professional interests include fuzzy logic and fuzzy sets, relational data analysis, and algorithms. He authored several papers in journals and conference proceedings. ...
Formal concept analysis with attribute priorities Formal concept analysis is a method used for data analysis with applications in various domains (Carpineto & Romano, 2004; Ganter & Wille, 1999) . ...
doi:10.1080/03081079.2013.765079
fatcat:tzdp4iemqrbtrewxx22jufdwpe
Concept-oriented model: inference in hierarchical multidimensional space
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
These models are mainly aimed at numeric (quantitative) analysis where the notions of inference and semantics are not well defined. ...
We propose a novel approach to inference in multidimensional space based on the concept-oriented model of data and introduce elementary operations which are then used to define constraint propagation and ...
This approach is based on using formal concept analysis (FCA) for finding a lattice of formal concepts. ...
arXiv:1409.3530v1
fatcat:q2eogrfgfzgg5llrb7lkmnb26y
Formal ontology, conceptual analysis and knowledge representation
1995
International Journal of Human-Computer Studies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
We introduce the notion of the ontological level, intermediate between the epistemological and the conceptual level discussed by Brachman, as a way to characterize a knowledge representation formalism ...
The purpose of this paper is to defend the systematic introduction of formal ontological principles in the current practice of knowledge engineering, to explore the various relationships between ontology ...
., where terms like role and concept have a formal, standard interpretation. ...
doi:10.1006/ijhc.1995.1066
fatcat:3n4gktlfnbejrmrazcsxxpijxi
Combining Clustering techniques and Formal Concept Analysis to characterize Interestingness Measures
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Formal Concept Analysis "FCA" is a data analysis method which enables to discover hidden knowledge existing in data. A kind of hidden knowledge extracted from data is association rules. ...
Given a quality measures evaluation matrix according to semantic properties, this paper describes how FCA can highlight quality measures with similar behavior in order to help the user during his choice ...
Validation process with Formal Concept Analysis. ...
arXiv:1008.3629v1
fatcat:ckprjk3fsjgjlnf6qaclfbtnrq
A Formal Context for Acyclic Join Dependencies
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we use Formal Concept Analysis (FCA) to characterize a set of AJDs that hold in a given dataset. ...
This present work simplifies and generalizes the characterization of Multivalued Dependencies with FCA. ...
This research work has been supported by the SGR2014-890 (MACDA) project of the Generalitat de Catalunya, and MINECO project APCOM (TIN2014-57226-P). ...
doi:10.1007/978-3-319-60438-1_55
fatcat:5nbac4nawnb3hn2q7xncjsgjfu
« Previous
Showing results 1 — 15 out of 487,075 results