Search results for " logic"
showing 10 items of 1720 documents
Reasoning with Vague Spatial Information from Upper Mesopotamia (2000BC)
2015
International audience; Concepts such as near, far, south of, etc., are by its own nature vague. However, they are quite common in human language. In the case of historical records, these concepts are often the only source of information regarding the position of ancient places whose exact location has been lost. In our research, we use digitized written records from Upper Mesopotamia (2000BC) from the HIGEOMES project. Our goal is to provide better understanding of the location of places, based on the analysis of spatial statements. In our approach, we analyse cardinal statements between places with known location. Using this information we construct a probabilistic function representing t…
A New Universal-Environment Adaptive Multi-processor Scheduler for Autonomous Cyber-Physical System
2012
International audience; Robot, spaceship and other applications that can be called autonomous Cyber-Physical Systems (CPS) are all smart embedded systems, which usually run in open environment by themselves with inhered intelligent capabilities. Besides the application intelligence, the researches of adaptive platform for such systems have also become topics recently. Based on the analysis of current work, a new environment adaptive scheduler (¦Á-S) for multiprocessor platform of a cyber-physical system is proposed in this article. And then, its related structures, models, and reasoning methods are studied deeply. Different from the existing ones, ¦Á-S can schedule all tasks according to th…
SCALESEM : Evaluation of Semantic Graph based on Model Checking
2011
International audience; Semantic interoperability problems have found their solutions using languages and techniques from the Semantic Web. The proliferation of ontologies and meta-information has improved the understanding of information and the relevance of search engine responses. However, the construction of semantic graphs is a source of numerous errors of interpretation or modelling and scalability remains a major problem. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border of two areas: the semantic web and the model checking. This line of research concerns …
RDF2SPIN: Mapping Semantic Graphs to SPIN Model Checker
2011
International audience; The most frequently used language to represent the semantic graphs is the RDF (W3C standard for meta-modeling). The construction of semantic graphs is a source of numerous errors of interpretation. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border between two areas: the semantic web and the model checking. For this, we developed a tool, RDF2SPIN, which converts RDF graphs into SPIN language. This conversion aims checking the semantic graphs with the model checker SPIN in order to verify the consistency of the data. To illustrate our propos…
Extending SPARQL with Temporal Logic
2009
The data integration and sharing activities carried on in the framework of the Semantic Web lead to large knowledge bases that must be queried, analyzed, and exploited efficiently. Many of the knowledge representation languages of the Semantic Web, starting with RDF, are based on directed, labeled graphs, which can be also manipulated using graph algorithms and tools coming from other domains. In this paper, we propose an analysis approach of RDF graphs by reusing the verification technology developed for concurrent systems. To this purpose, we define a translation from the SPARQL query language into XTL, a general-purpose graph manipulation language implemented in the CADP verification too…
Qualifying semantic graphs using model checking
2011
International audience; Semantic interoperability problems have found their solutions using languages and techniques from the Semantic Web. The proliferation of ontologies and meta-information has improved the understanding of information and the relevance of search engine responses. However, the construction of semantic graphs is a source of numerous errors of interpretation or modeling and scalability remains a major problem. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border of two areas: the semantic web and the model checking. This line of research concerns t…
A new approach based on NμSMV Model to query semantic graph
2011
International audience; The language most frequently used to represent the semantic graphs is the RDF (W3C standard for meta-modeling). The construction of semantic graphs is a source of numerous errors of interpretation. Processing of large semantic graphs can be a limit to use semantics in modern information systems. The work presented in this paper is part of a new research at the border between two areas: the semantic web and the model checking. For this, we developed a tool, RDF2NμSMV, which converts RDF graphs into NμSMV language. This conversion aims checking the semantic graphs with the model checker NμSMV in order to verify the consistency of the data. The data integration and shar…
Reaction-Diffusion Network For Geometric Multiscale High Speed Image Processing
2010
International audience; In the framework of heavy mid-level processing for high speed imaging, a nonlinear bi-dimensional network is proposed, allowing the implementation of active curve algorithms. Usually this efficient type of algorithm is prohibitive for real-time image processing due to its calculus charge and the inadequate structure for the use of serial or parallel architectures. Another kind of implementation philosophy is proposed here, by considering the active curve generated by a propagation phenomenon inspired from biological modeling. A programmable nonlinear reaction-diffusion system is proposed under front control and technological constraints. Geometric multiscale processin…
Ping-pong configurations and circular orders on free groups
2017
We discuss actions of free groups on the circle with "ping-pong" dynamics; these are dynamics determined by a finite amount of combinatorial data, analogous to Schottky domains or Markov partitions. Using this, we show that the free group $F_n$ admits an isolated circular order if and only if n is even, in stark contrast with the case for linear orders. This answers a question from (Mann, Rivas, 2016). Inspired by work of Alvarez, Barrientos, Filimonov, Kleptsyn, Malicet, Menino and Triestino, we also exhibit examples of "exotic" isolated points in the space of all circular orders on $F_2$. Analogous results are obtained for linear orders on the groups $F_n \times \mathbb{Z}$.
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.