Search results for "languages"
showing 10 items of 2101 documents
Free vs. Locally Free Kleinian Groups
2015
Abstract We prove that Kleinian groups whose limit sets are Cantor sets of Hausdorff dimension < < 1 are free. On the other hand we construct for any ε > > 0 an example of a non-free purely hyperbolic Kleinian group whose limit set is a Cantor set of Hausdorff dimension < < 1 + + ε.
Some Computational Aspects of DISTANCE-SAT
2007
In many AI fields, one must face the problem of finding a solution that is as close as possible to a given configuration. This paper addresses this problem in a propositional framework. We introduce the decision problem distance-sat, which consists in determining whether a propositional formula admits a model that disagrees with a given partial interpretation on at most d variables. The complexity of distance-sat and of several restrictions of it are identified. Two algorithms based on the well-known Davis/Logemann/Loveland search procedure for the satisfiability problem sat are presented so as to solve distance-sat for CNF formulas. Their computational behaviors are compared with the ones …
How to Enrich Description Logics with Fuzziness
2017
International audience; The paper describes the relation between fuzzy and non-fuzzy description logics. It gives an overview about current research in these areas and describes the difference between tasks for description logics and fuzzy logics. The paper also deals with the transformation properties of description logics to fuzzy logics and backwards. While the process of transformation from a description logic to a fuzzy logic is a trivial inclusion, the other way of reducing information from fuzzy logic to description logic is a difficult task, that will be topic of future work.
Attempts to produce minimal Resolution refutations
2018
We address the challenge of searching minimal refutations proofs of inconsistent CNF formulae using the Resolution rule. We propose two algorithms which can only afford formulae of at most 5 variables with a desktop computer. A faster but incomplete algorithm is used to produce "hard" 5 variables 3CNF formulae though a stochastic greedy search. It allowed us to find formulae that can be refuted by producing clauses of at most 3 literals, but whose all minimal refutations contain at least one clause of 4 literals.
Reconnaissance de la Forme 3D et Estimation de la Profondeur Implémentation sur FPGA Spartan 3A d'un SoC pour la Vision 3D (Shape From Focus) Problém…
2007
Le terme de « vision 3D » ou « de numérisation 3D », est apparu à la fin des années 1990, pour désigner des techniques d'acquisition de mesures tridimensionnelle sur des surfaces, techniques ayant la caractéristique de donner des nuages de points denses et importants dont l'ordre de grandeur est de quelques dizaines à plusieurs millions de points. Le nuage de points représente en fait l'information de l'image de profondeur et selon des différents traitements à l'image on peut aboutir à un ordre de précision de la reconstitution de l'objet ou scène en 3D. La vision 3D demeure une méthodologie de base pour réassurer le mécanisme de reconstitution des images tridimensionnelles. Outre les besoi…
Topological properties of cellular automata on trees
2012
We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.
XA2C Framework for XML Alteration/Adaptation
2010
XML has crossed the borders of software engineering and has spread to other areas such as e-commerce, identification, information storage, instant messaging and others. It is used to communicate crucial data over these domains. Thus, allowing non-expert programmers to manipulate and control their XML data is essential. In the literature, this issue has been dealt with from 3 perspectives: (i) XML alteration/adaptation techniques requiring a certain level of expertise to be implemented and are not unified yet, (ii) mashups, which are not formally defined yet and are not specific to XML data, and (iii) XML-oriented visual languages based on structural transformations and data extraction mainl…
Towards an XML Adaptation/Alteration Control Framework
2010
International audience
OntoVersionGraph : a change management methodology dedicated to formal ontologies and their user views in a collaborative context
2014
The world changes over time, impacting the knowledge of every subdomain it contains. Therefore systems describing the knowledge of a certain domain should be able to consider changes occurred to keep its knowledge representation up-to-date. Formal ontologies are one of them: they explicitly and formally represent the knowledge of a domain in all its forms and modes of existence. Collaboratively developed, a formal ontology allows the domain users to understand each other by sharing the same terminology despite the different assumptions they have on the domain conceptualization. However, due to its completeness, the complexity of its conceptualization can sometimes make the domain knowledge …
Asymptotic bit frequency in Fibonacci words
2021
It is known that binary words containing no $k$ consecutive 1s are enumerated by $k$-step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length $n$ having this property.