The Experts below are selected from a list of 109224 Experts worldwide ranked by ideXlab platform
Fabien Gandon - One of the best experts on this subject based on the ideXlab platform.
-
Possibilistic testing of OWL Axioms against RDF data
International Journal of Approximate Reasoning, 2017Co-Authors: Andrea G. B. Tettamanzi, Catherine Faron Zucker, Fabien GandonAbstract:We develop the theory of a possibilistic framework for OWL 2 Axiom testing against RDF datasets, as an alternative to statistics-based heuristics. The intuition behind it is to evaluate the credibility of OWL 2 Axioms based on the evidence available in the form of a set of facts contained in a chosen RDF dataset. To achieve it, we first define the notions of development, content, support, confirmation and counterexample of an Axiom. Then we use these notions to define the possibility and necessity of an Axiom and its acceptance/rejection index combining both of them. Finally, we report a practical application of the proposed framework to test SubClassOf Axioms against the DBpedia RDF dataset.
-
Dynamically Time-Capped Possibilistic Testing of SubClassOf Axioms Against RDF Data to Enrich Schemas
2015Co-Authors: Andrea G. B. Tettamanzi, Catherine Faron Zucker, Fabien GandonAbstract:Axiom scoring is a critical task both for the automatic en-richment/learning and for the automatic validation of knowledge bases and ontologies. We designed and developed an Axiom scoring heuristic based on possibility theory, which aims at overcoming some limitations of scoring heuristics based on statistical inference and taking into account the open-world assumption of the linked data on the Web. Since computing the possibilistic score can be computationally quite heavy for some candidate Axioms, we propose a method based on time capping to alleviate the computation of the heuristic without giving up the precision of the scores. We evaluate our proposal by applying it to the problem of testing SubClassOf Axioms against the DBpedia RDF dataset.
Andrea G. B. Tettamanzi - One of the best experts on this subject based on the ideXlab platform.
-
An Evolutionary Approach to Class Disjointness Axiom Discovery
2019Co-Authors: Thu Huong Nguyen, Andrea G. B. TettamanziAbstract:Axiom learning is an essential task in enhancing the quality of an ontology, a task that sometimes goes under the name of ontology enrichment. To overcome some limitations of recent work and to contribute to the growing library of ontology learning algorithms, we propose an evolutionary approach to automatically discover Axioms from the abundant RDF data resource of the Semantic Web. We describe a method applying an instance of an Evolutionary Algorithm, namely Grammatical Evolution, to the acquisition of OWL class dis-jointness Axioms, one important type of OWL Axioms which makes it possible to detect logical inconsistencies and infer implicit information from a knowledge base. The proposed method uses an Axiom scoring function based on possibility theory and is evaluated against a Gold Standard, manually constructed by knowledge engineers. Experimental results show that the given method possesses high accuracy and good coverage.
-
Possibilistic testing of OWL Axioms against RDF data
International Journal of Approximate Reasoning, 2017Co-Authors: Andrea G. B. Tettamanzi, Catherine Faron Zucker, Fabien GandonAbstract:We develop the theory of a possibilistic framework for OWL 2 Axiom testing against RDF datasets, as an alternative to statistics-based heuristics. The intuition behind it is to evaluate the credibility of OWL 2 Axioms based on the evidence available in the form of a set of facts contained in a chosen RDF dataset. To achieve it, we first define the notions of development, content, support, confirmation and counterexample of an Axiom. Then we use these notions to define the possibility and necessity of an Axiom and its acceptance/rejection index combining both of them. Finally, we report a practical application of the proposed framework to test SubClassOf Axioms against the DBpedia RDF dataset.
-
Dynamically Time-Capped Possibilistic Testing of SubClassOf Axioms Against RDF Data to Enrich Schemas
2015Co-Authors: Andrea G. B. Tettamanzi, Catherine Faron Zucker, Fabien GandonAbstract:Axiom scoring is a critical task both for the automatic en-richment/learning and for the automatic validation of knowledge bases and ontologies. We designed and developed an Axiom scoring heuristic based on possibility theory, which aims at overcoming some limitations of scoring heuristics based on statistical inference and taking into account the open-world assumption of the linked data on the Web. Since computing the possibilistic score can be computationally quite heavy for some candidate Axioms, we propose a method based on time capping to alleviate the computation of the heuristic without giving up the precision of the scores. We evaluate our proposal by applying it to the problem of testing SubClassOf Axioms against the DBpedia RDF dataset.
Victor Pambuccian - One of the best experts on this subject based on the ideXlab platform.
-
the simplest Axiom system for plane hyperbolic geometry revisited
Studia Logica, 2011Co-Authors: Victor PambuccianAbstract:Using the Axiom system provided by Carsten Augat in [1], it is shown that the only 6-variable statement among the Axioms of the Axiom system for plane hyperbolic geometry (in Tarski's language L B?), we had provided in [3], is superfluous. The resulting Axiom system is the simplest possible one, in the sense that each Axiom is a statement in prenex form about at most 5 points, and there is no Axiom system consisting entirely of at most 4-variable statements.
-
the complexity of plane hyperbolic incidence geometry is
Mathematical Logic Quarterly, 2005Co-Authors: Victor PambuccianAbstract:We show that plane hyperbolic geometry, expressed in terms of points and the ternary relation of collinearity alone, cannot be expressed by means of Axioms of complexity at most ∀∃∀, but that there is an Axiom system, all of whose Axioms are ∀∃∀∃ sentences. This remains true for Klingenberg's generalized hyperbolic planes, with arbitrary ordered fields as coordinate fields. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)
-
the simplest Axiom system for plane hyperbolic geometry
Studia Logica, 2004Co-Authors: Victor PambuccianAbstract:We provide a quantifier-free Axiom system for plane hyperbolic geometry in a language containing only absolute geometrically meaningful ternary operations (in the sense that they have the same interpretation in Euclidean geometry as well). Each Axiom contains at most 4 variables. It is known that there is no Axiom system for plane hyperbolic consisting of only prenex 3-variable Axioms. Changing one of the Axioms, one obtains an Axiom system for plane Euclidean geometry, expressed in the same language, all of whose Axioms are also at most 4-variable universal sentences. We also provide an Axiom system for plane hyperbolic geometry in Tarski's language LB≡ which might be the simplest possible one in that language.
-
Splitting the pasch Axiom
Journal of Geometry, 1996Co-Authors: Victor PambuccianAbstract:On the basis of the theorye− of Pasch-free 2-dimensional geometry, Pasch's Axiom is shown to be equivalent to the conjunction of the following two Axioms: “In any right triangle the hypotenuse is greater than the leg” and “If ∠AOB is right, B lies between O and C, and D is the footpoint of the perpendicular from B to AC, then the segment OA is greater than the segment BD.” This represents an attempt to split the Pasch Axiom with respect toe−. Only the question whether the second of the above two Axioms is really weaker than Pasch's Axiom, remains open.
Catherine Faron Zucker - One of the best experts on this subject based on the ideXlab platform.
-
Possibilistic testing of OWL Axioms against RDF data
International Journal of Approximate Reasoning, 2017Co-Authors: Andrea G. B. Tettamanzi, Catherine Faron Zucker, Fabien GandonAbstract:We develop the theory of a possibilistic framework for OWL 2 Axiom testing against RDF datasets, as an alternative to statistics-based heuristics. The intuition behind it is to evaluate the credibility of OWL 2 Axioms based on the evidence available in the form of a set of facts contained in a chosen RDF dataset. To achieve it, we first define the notions of development, content, support, confirmation and counterexample of an Axiom. Then we use these notions to define the possibility and necessity of an Axiom and its acceptance/rejection index combining both of them. Finally, we report a practical application of the proposed framework to test SubClassOf Axioms against the DBpedia RDF dataset.
-
Dynamically Time-Capped Possibilistic Testing of SubClassOf Axioms Against RDF Data to Enrich Schemas
2015Co-Authors: Andrea G. B. Tettamanzi, Catherine Faron Zucker, Fabien GandonAbstract:Axiom scoring is a critical task both for the automatic en-richment/learning and for the automatic validation of knowledge bases and ontologies. We designed and developed an Axiom scoring heuristic based on possibility theory, which aims at overcoming some limitations of scoring heuristics based on statistical inference and taking into account the open-world assumption of the linked data on the Web. Since computing the possibilistic score can be computationally quite heavy for some candidate Axioms, we propose a method based on time capping to alleviate the computation of the heuristic without giving up the precision of the scores. We evaluate our proposal by applying it to the problem of testing SubClassOf Axioms against the DBpedia RDF dataset.
Ewen Denney - One of the best experts on this subject based on the ideXlab platform.
-
A framework for testing first-order logic Axioms in program verification
Software Quality Journal, 2013Co-Authors: Ewen DenneyAbstract:Program verification systems based on automated theorem provers rely on user-provided Axioms in order to verify domain-specific properties of code. However, formulating Axioms correctly (that is, formalizing properties of an intended mathematical interpretation) is non-trivial in practice, and avoiding or even detecting unsoundness can sometimes be difficult to achieve. Moreover, speculating soundness of Axioms based on the output of the provers themselves is not easy since they do not typically give counterexamples. We adopt the idea of model-based testing to aid Axiom authors in discovering errors in Axiomatizations. To test the validity of Axioms, users define a computational model of the Axiomatized logic by giving interpretations to the function symbols and constants in a simple declarative programming language. We have developed an Axiom testing framework that helps automate model definition and test generation using off-the-shelf tools for meta-programming, property-based random testing, and constraint solving. We have experimented with our tool to test the Axioms used in Auto-Cert , a program verification system that has been applied to verify aerospace flight code using a first-order Axiomatization of navigational concepts, and were able to find counterexamples for a number of Axioms.
