Relevant bibliographies by topics / Region connection calculus

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Region connection calculus'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Region connection calculus.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Region connection calculus"

1

Li, Sanjiang, and Mingsheng Ying. "Generalized Region Connection Calculus." Artificial Intelligence 160, no. 1-2 (December 2004): 1–34. http://dx.doi.org/10.1016/j.artint.2004.05.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Stell, J. G. "Boolean connection algebras: A new approach to the Region-Connection Calculus." Artificial Intelligence 122, no. 1-2 (September 2000): 111–36. http://dx.doi.org/10.1016/s0004-3702(00)00045-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Renz, Jochen. "A Canonical Model of the Region Connection Calculus." Journal of Applied Non-Classical Logics 12, no. 3-4 (January 2002): 469–94. http://dx.doi.org/10.3166/jancl.12.469-494.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Sanjiang, and Mingsheng Ying. "Region Connection Calculus: Its models and composition table." Artificial Intelligence 145, no. 1-2 (April 2003): 121–46. http://dx.doi.org/10.1016/s0004-3702(02)00372-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Schockaert, Steven, Martine De Cock, Chris Cornelis, and Etienne E. Kerre. "Fuzzy region connection calculus: Representing vague topological information." International Journal of Approximate Reasoning 48, no. 1 (April 2008): 314–31. http://dx.doi.org/10.1016/j.ijar.2007.10.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Weiming, and Sanjiang Li. "On standard models of fuzzy region connection calculus." International Journal of Approximate Reasoning 52, no. 9 (December 2011): 1337–54. http://dx.doi.org/10.1016/j.ijar.2011.07.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sabharwal, Chaman L., and Jennifer L. Leopold. "Evolution of Region Connection Calculus to VRCC-3D+." New Mathematics and Natural Computation 10, no. 02 (June 3, 2014): 103–41. http://dx.doi.org/10.1142/s1793005714500069.

Full text
Abstract:
Qualitative spatial reasoning (QSR) is useful for deriving logical inferences when quantitative spatial information is not available. QSR theories have applications in areas such as geographic information systems, spatial databases, robotics, and cognitive sciences. The existing QSR theories have been applied primarily to 2D. The ability to perform QSR over a collection of 3D objects is desirable in many problem domains. Here we present the evolution (VRCC-3D+) of RCC-based QSR from 2D to both 3D (including occlusion support) and 4D (a temporal component). It is time consuming to construct large composition tables manually. We give a divide-and-conquer algorithm to construct a comprehensive composition table from smaller constituent tables (which can be easily handcrafted). In addition to the logical consistency entailment checking that is required for such a system, clearly there is a need for a spatio-temporal component to account for spatial movements and path consistency (i.e. to consider only smooth transitions in spatial movements over time). Visually, these smooth movement phenomena are represented as a conceptual neighborhood graph. We believe that the methods presented herein to detect consistency, refine uncertainty, and enhance reasoning about 3D objects will provide useful guidelines for other studies in automated spatial reasoning.
APA, Harvard, Vancouver, ISO, and other styles
8

Schockaert, Steven, Martine De Cock, and Etienne E. Kerre. "Spatial reasoning in a fuzzy region connection calculus." Artificial Intelligence 173, no. 2 (February 2009): 258–98. http://dx.doi.org/10.1016/j.artint.2008.10.009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Düntsch, Ivo, Hui Wang, and Steve McCloskey. "A relation – algebraic approach to the region connection calculus." Theoretical Computer Science 255, no. 1-2 (March 2001): 63–83. http://dx.doi.org/10.1016/s0304-3975(99)00156-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Schockaert, Steven, Martine De Cock, Chris Cornelis, and Etienne E. Kerre. "Fuzzy region connection calculus: An interpretation based on closeness." International Journal of Approximate Reasoning 48, no. 1 (April 2008): 332–47. http://dx.doi.org/10.1016/j.ijar.2007.10.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Region connection calculus"

1

Ben, othmane Amel. "CARS-Un système multi-agent pour la prise de décision dans des applications spatiotemporelles incertaines." Thesis, Université Côte d'Azur (ComUE), 2017. http://www.theses.fr/2017AZUR4086/document.

Full text
Abstract:
Récemment, plusieurs applications, dans lesquelles différentes entités interagissent dans un environnement dynamique, soulignent l’intérêt de l’utilisation des architectures multi-agents. Ces architectures offrent, dans ce cadre, un certain nombre d’avantages, tels que l’autonomie, la réactivité et la capacité de prise de décision. Elles manquent cependant de capacité sociale et de connaissances sur son environnement, notamment lorsqu’il s’agit d’un environnement dynamique. En effet, quand un agent interagit avec le monde réel, il doit prendre en compte les évènements qui peuvent survenir tout en considérant centaines contraintes telles que le temps et l’espace. En outre, les agents doivent faire face à l’incertitude liée aux applications réelles afin de fournir une représentation fidèle du monde réel. Dans le cadre de cette thèse, nous proposons un modèle formel de recommandation des plans qui améliore le processus de prise de décision des agents dans un environnement spatio-temporel et incertain. Pour formaliser les comportements cognitifs des agents dans notre système nommé CARS, en anglais ``Cognitive Agent-based Recommender System '', nous avons étendu l’architecture BDI qui se base sur le modèle `` Croyance-Désir-Intention'' pour prendre en compte les différents contextes liés à des applications réelles en particulier le contexte social. Par ailleurs, nous avons également utilisé la théorie possibiliste afin de considérer l’incertitude dans l’état motivationnel d’un agent (c’est à dire ses croyances, désirs, objectifs ou intentions). Pour répondre aux besoins des applications réelles, tels que les systèmes de recommandation relatives au trafic et navigation, nous proposons une représentation spatiotemporelle des croyances et des intentions d’un agent. Cette représentation permettra l’anticipation de certaines intentions, de manière à recommander un plan qui sera optimal pour un utilisateur. Compte tenu l’incomplétude/l’imprécision liée aux données spatiotemporelles, nous avons étendu le modèle proposé pour raisonner avec des croyances et intentions floues. Une évaluation du modèle proposé a été menée en utilisant une simulation multi-agent, dans un scenario réel de circulation routière. Cette simulation a offert un environnement virtuel qui a mis en lumière, après avoir testé les différentes fonctionnalités du modèle, les principaux points forts ainsi que leslacunes liées à l’architecture multi-agents proposée
Recently, many real-world applications where different entities interact in a dynamic environment, consider the use of agents in their architectures due principally to their autonomy, reactivity and decision-making abilities. Though these systems can be made intelligent, using Artificial Intelligence (AI) techniques, agents still lack of social abilities and have limited knowledge of their environment and in particular when it comes to a dynamic environment. In fact, when operating in the real world, agents need to deal with unexpected events considering both changes in time and space. Moreover, agents must face the uncertainty, which pervades real-world scenarios in order to provide an accurate representation of the world. In this thesis, we introduce and evaluate a formal framework for recommending plans to agents in the decision making process, when they deal with uncertain spatio-temporal information. The agent-based architecture we propose to address this issue, called CARS (Cognitive Agent-based Recommender System), has been designed by extending the well-known Belief-Desire-Intention (BDI) architecture to incorporate further capabilities to support reasoning with different types of contextual information, including the social context. Uncertainty on the agent's beliefs, desires and intentions is modeled using possibility theory. To meet the requirements of real-world applications, e.g., traffic and navigation recommendation systems, we define a spatio-temporal representation of the agents' beliefs and intentions. Using such a formal framework, anticipatory reasoning about intentional dynamics can be performed with the aim to recommend an optimal plan to a certain user. Since spatio-temporal data is often considered as incomplete and/or vague, we extended the formal framework with a fuzzy representation of spatio-temporal beliefs and intentions. The framework is evaluated through an Agent Based Simulation (ABS) in a real-world traffic scenario. This ABS allowed us to create a virtual environment to test the impact of the different features of our framework as well as to evaluating the main strengths and weaknesses of the proposed agent architecture
APA, Harvard, Vancouver, ISO, and other styles
2

Chipofya, Malumbo Chaka. "A qualitive reasoning approach for improving query results for sketch based queries by topological analysis of spatial aggregation." Master's thesis, 2010. http://hdl.handle.net/10362/8258.

Full text
Abstract:
Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.
Sketch-based spatial query systems provide an intuitive method of user interaction for spatial databases. These systems must be capable of interpreting user sketches in a way that matches the information that the user intended to provide. One challenge that must be overcome is that humans always simplify the environments they have experienced and this is reflected in the sketches they draw. One such simplification is manifested as aggregation or combination of spatial objects into conceptually or spatially related groups. In this thesis I develop a system that uses reasoning tools of the RCC-8 to evaluate sketchbased queries and provide a method for minimizing the effects of aggregation by determining whether a solution to a query can be expanded if some groups of regions are assumed to be parts of a larger aggregate region. If such a group of regions is found, then this group must be included in the solution. The solution is approximate because the approach taken only verifies that assumed parts of an aggregate are not inconsistent with the configuration of the whole solution. Only cases where the size of the solution equals the size of the query minus one are analysed. It is observed that correctly identifying aggregated regions leads to solutions that are more similar to the original query sketch when the size of every other solution is smaller than the size of the query or when a lower limit is placed on the acceptable size of a solution because the new, expanded or refined solution becomes more complete with respect to the sketch of the query.
APA, Harvard, Vancouver, ISO, and other styles
3

santacà, katia. "Attack States Identification in a Logical Framework of Communicating Agents." Doctoral thesis, 2019. http://hdl.handle.net/11562/995241.

Full text
Abstract:
A channel is a logical space where agents make announcements publicly. Examples of such objects are forums, wikis and social networks. Several questions arise about the nature of such a statement as well as about the attitude of the agent herself in doing these announcements. Does the agent know whether the statement is true? Is this agent announcing that statement or its opposite in any other channel? Extensions to Dynamic Epistemic Logics have been proposed in the recent past that give account to public announcements. One major limit of these logics is that announcements are always considered truthful. It is however clear that, in real life, incompetent agents may announce false things, while deceitful agents may even announce things they do not believe in. In this thesis, we provide a logical framework, called Multiple Channel Logic (MCL), able to relate true statements, agent beliefs, and announcements on communication channels. We discuss syntax and semantics of this logic and show the behavior of the pr
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Region connection calculus"

1

Straus, Scott. Political Science and Genocide. Edited by Donald Bloxham and A. Dirk Moses. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199232116.013.0009.

Full text
Abstract:
This article discusses the relationship between political science and genocide, focusing on three major themes. First, it discusses the evolution of genocide studies within the discipline and expands on this. Second, it identifies seminal contributions that have emerged from some four decades of political science studies of genocide: a methodological emphasis on the comparative method, including both quantitative and qualitative studies; a move to broaden the concept of genocide using related but different terms; a theoretical emphasis on regime type; a theoretical emphasis on political leaders' decision-making calculus — more specifically, political scientists have been in the forefront of developing rationalist explanations of genocide; and a theoretical emphasis on the connections between warfare and genocide. Third, it presents some general critiques of political science approaches and suggests avenues for future research in the discipline.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Region connection calculus"

1

Shekhar, Shashi, and Hui Xiong. "Region Connection Calculus." In Encyclopedia of GIS, 956. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_1101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hu, He. "Deep Topological Reasoning with Region Connection Calculus." In Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery, 830–37. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-89698-0_85.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Balbiani, Philippe, and Çiğdem Gencer. "Finitariness of Elementary Unification in Boolean Region Connection Calculus." In Frontiers of Combining Systems, 281–97. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66167-4_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Serrano, Miguel A., Miguel A. Patricio, Jesús García, and José M. Molina. "Automatically Updating a Dynamic Region Connection Calculus for Topological Reasoning." In Advances in Intelligent and Soft Computing, 69–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19908-0_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Schwarzentruber, François, and Jin-Kao Hao. "Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search." In Logics in Artificial Intelligence, 582–90. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11558-0_41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Davari, Somayeh, and Nasser Ghadiri. "Fuzzy Region Connection Calculus and Its Application in Fuzzy Spatial Skyline Queries." In Advances in Intelligent Systems and Computing, 659–77. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-22871-2_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lee, Ickjai, and Mary-Anne Williams. "Multi-level Clustering and Reasoning about Its Clusters Using Region Connection Calculus." In Advances in Knowledge Discovery and Data Mining, 283–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-36175-8_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Staffetti, Ernesto, Antoni Grau, Francesc Serratosa, and Alberto Sanfeliu. "Shape Representation and Indexing Based on Region Connection Calculus and Oriented Matroid Theory." In Discrete Geometry for Computer Imagery, 267–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39966-7_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sabharwal, Chaman L., and Jennifer L. Leopold. "Identification of Relations in Region Connection Calculus: 9-Intersection Reduced to 3 + -Intersection Predicates." In Lecture Notes in Computer Science, 362–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45111-9_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sabharwal, Chaman L., and Jennifer L. Leopold. "Qualitative Spatial Reasoning in 3D: Spatial Metrics for Topological Connectivity in a Region Connection Calculus." In Mining Intelligence and Knowledge Exploration, 215–28. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-13817-6_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Region connection calculus"

1

Davari, Somayeh, and Nasser Ghadiri. "Spatial database implementation of fuzzy region connection calculus for analysing the relationship of diseases." In 2015 23rd Iranian Conference on Electrical Engineering (ICEE). IEEE, 2015. http://dx.doi.org/10.1109/iraniancee.2015.7146310.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bouraoui, Zied, Sébastien Konieczny, Thanh Ma, Nicolas Schwind, and Ivan Varzinczak. "Region-Based Merging of Open-Domain Terminological Knowledge." In 19th International Conference on Principles of Knowledge Representation and Reasoning {KR-2022}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/kr.2022/9.

Full text
Abstract:
This paper introduces a novel method for merging open-domain terminological knowledge. It takes advantage of the Region Connection Calculus (RCC5), a formalism used to represent regions in a topological space and to reason about their set-theoretic relationships. To this end, we first propose a faithful translation of terminological knowledge provided by several and potentially conflicting sources into region spaces. The merging is then performed on these spaces, and the result is translated back into the underlying language of the input sources. Our approach allows us to benefit from the expressivity and the flexibility of RCC5 while dealing with conflicting knowledge in a principled way.
APA, Harvard, Vancouver, ISO, and other styles
3

Sioutis, Michael, and Jean-François Condotta. "Efficiently Enforcing Path Consistency on Qualitative Constraint Networks by Use of Abstraction." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/175.

Full text
Abstract:
Partial closure under weak composition, or partial weak path-consistency for short, is essential for tackling fundamental reasoning problems associated with qualitative constraint networks, such as the satisfiability checking problem, and therefore it is crucial to be able to enforce it as fast as possible. To this end, we propose a new algorithm, called PWCα, for efficiently enforcing partial weak path-consistency on qualitative constraint networks, that exploits the notion of abstraction for qualitative constraint networks, utilizes certain properties of partial weak path-consistency,and adapts the functionalities of some state-of-the-art algorithms to its design. It is worth noting that, as opposed to a related approach in the recent literature, algorithm PWCα is complete for arbitrary qualitative constraint networks. The evaluation that we conducted with qualitative constraint networks of the Region Connection Calculus against a competing state-of-the-art generic algorithm for enforcing partial weak path-consistency, demonstrates the usefulness and efficiency of algorithm PWCα.
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Sanjiang, Zhiguo Long, Weiming Liu, Matt Duckham, and Alan Both. "On Redundant Topological Constraints (Extended Abstract)." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/714.

Full text
Abstract:
Redundancy checking is an important task in AI subfields such as knowledge representation and constraint solving. This paper considers redundant topological constraints, defined in the region connection calculus RCC8. We say a constraint in a set C of RCC8 constraints is redundant if it is entailed by the rest of C. A prime subnetwork of C is a subset of C which contains no redundant constraints and has the same solution set as C. It is natural to ask how to compute such a prime subnetwork, and when it is unique. While this problem is in general intractable, we show that, if S is a subalgebra of RCC8 in which weak composition distributes over nonempty intersections, then C has a unique prime subnetwork, which can be obtained in cubic time by removing all redundant constraints simultaneously from C. As a by-product, we show that any path-consistent network over such a distributive subalgebra is minimal.
APA, Harvard, Vancouver, ISO, and other styles
5

Brake, M. R. "A Hybrid Approach for the Modal Analysis of Continuous Systems With Localized Nonlinear Constraints." In ASME 2010 International Mechanical Engineering Congress and Exposition. ASMEDC, 2010. http://dx.doi.org/10.1115/imece2010-37377.

Full text
Abstract:
The analysis of continuous systems with nonlinearities in their domain have previously been limited to either numerical approaches, or analytical methods that are constrained in the parameter space, boundary conditions, or order of the system. The present analysis develops a robust method for studying continuous systems with arbitrary boundary conditions and nonlinearities using the assumption that the nonlinear constraint can be modeled with a piecewise-linear force-deflection constitutive relationship. Under this assumption, a superposition method is used to generate homogeneous boundary conditions, and modal analysis is used to find the displacement of the system in each state of the piecewise-linear nonlinearity. In order to map across each nonlinearity in the piecewise-linear force-deflection profile, a variational calculus approach is taken that minimizes the L2 energy norm between the previous and current states. To illustrate this method, a leaf spring coupled with a connector pin immersed in a viscous fluid is modeled as a beam with a piecewise-linear constraint. From the results of the convergence and parameter studies, a high correlation between the finite-time Lyapunov exponents and the contact time per period of the excitation is observed. The parameter studies also indicate that when the system’s parameters are changed in order to reduce the magnitude of the velocity impact between the leaf spring and connector pin, the extent of the regions over which a chaotic response is observed increases.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Region connection calculus' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography