Relevant bibliographies by topics / Description logics with spatial operators

Contents

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

Academic literature on the topic 'Description logics with spatial operators'

Author: Grafiati
Published: 11 March 2023
Last updated: 31 July 2025

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 'Description logics with spatial operators.'

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 "Description logics with spatial operators"

1

Schoop, D., and J. Bernauer. "Formal Classification of Medical Concept Descriptions: Graph-Oriented Operators." Methods of Information in Medicine 37, no. 04/05 (1998): 510–17. http://dx.doi.org/10.1055/s-0038-1634546.

Full text
Abstract:
AbstractA crucial component of a medical concept representation system is the classifier. It requires features that are not sufficiently supported by current logic based formalisms like description logics and conceptual graphs. Those features are, for instance, the representation of partitive and spatial relations and their impact on sUbsumption. This paper introduces graph oriented classification operators for a concept representation language with normal forms. Emphasis is on the separation of generic and partitive relations and on the mutual interdependence of sUbsumption and part-whole. Fo
APA, Harvard, Vancouver, ISO, and other styles
2

MARTSENYUK, VASYL, IGOR ANDRUSHCHAK, NATALIIA KOZODII, YURII KRAVCHYK, ANDRIY SVERSTIUK, and YURI PALANIZA. "COMPARISON OF RESULTS OF NUMERICAL ANALYSIS OF SIMULATION OF CYBERPHYSICAL BIOSENSOR SYSTEMS." Herald of Khmelnytskyi National University. Technical sciences 319, no. 2 (2023): 202–12. http://dx.doi.org/10.31891/2307-5732-2023-319-1-202-212.

Full text
Abstract:
The article compares the results of numerical modeling of mathematical models of cyber-physical biosensor systems using lattice difference equations with time delay on hexagonal and rectangular lattices. The main attention is paid to the mathematical description of the dynamics of a discrete population in combination with the dynamic logic of the studied models. Lattice difference equations with delay are proposed for modeling the antigen-antibody interaction in hexagonal and rectangular biopixels. Similar to the diffusion phenomenon, spatial operators are considered to model the interaction b
APA, Harvard, Vancouver, ISO, and other styles
3

Nascimento, Maikon, Jing Li, and Dileepan Joseph. "Efficient Pipelined Circuits for Histogram-based Tone Mapping of Nonlinear CMOS Image Sensors." Journal of Imaging Science and Technology 65, no. 4 (2021): 40503–1. http://dx.doi.org/10.2352/j.imagingsci.technol.2021.65.4.040503.

Full text
Abstract:
Abstract Tone mapping is extensively researched to address the issue of displaying high dynamic range (DR) scenes on low DR displays. Even though several tone-mapping operators (TMOs) exist, not all are designed for hard real time. The operator has to be capable of scaling up the spatial resolution without compromising the frame rate. The implementation of a TMO should also be simple enough to embed in low-cost platforms for imaging systems. A computationally efficient, and well accepted, class of TMOs are global ones based on histograms. This work presents a method to implement TMOs that use
APA, Harvard, Vancouver, ISO, and other styles
4

Lehmann, Jens, and Pascal Hitzler. "Concept learning in description logics using refinement operators." Machine Learning 78, no. 1-2 (2009): 203–50. http://dx.doi.org/10.1007/s10994-009-5146-2.

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

Kamide, Norihiro. "Linear and affine logics with temporal, spatial and epistemic operators." Theoretical Computer Science 353, no. 1-3 (2006): 165–207. http://dx.doi.org/10.1016/j.tcs.2005.10.043.

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

Sofronie-Stokkermans, Viorica. "Locality and Applications to Subsumption Testing in EL and Some of its Extensions." Scientific Annals of Computer Science XXIII, no. 2 (2013): 251–84. https://doi.org/10.7561/SACS.2013.2.251.

Full text
Abstract:
In this paper we show that subsumption problems in the description logics EL and EL<sup>+</sup>&nbsp;can be expressed as uniform word problems in classes of semilattices with monotone operators. We use possibilities of efficient local reasoning in such classes of algebras, to obtain uniform PTIME decision procedures for TBox and CBox subsumption in EL and EL<sup>+</sup>. These locality considerations allow us to present a new family of (possibly many-sorted) logics which extend EL and EL<sup>+</sup> with n-ary roles and/or numerical domains.
APA, Harvard, Vancouver, ISO, and other styles
7

Fanizzi, Nicola. "Concept Induction in Description Logics Using Information-Theoretic Heuristics." International Journal on Semantic Web and Information Systems 7, no. 2 (2011): 23–44. http://dx.doi.org/10.4018/jswis.2011040102.

Full text
Abstract:
This paper presents an approach to ontology construction pursued through the induction of concept descriptions expressed in Description Logics. The author surveys the theoretical foundations of the standard representations for formal ontologies in the Semantic Web. After stating the learning problem in this peculiar context, a FOIL-like algorithm is presented that can be applied to learn DL concept descriptions. The algorithm performs a search through a space of candidate concept definitions by means of refinement operators. This process is guided by heuristics that are based on the available
APA, Harvard, Vancouver, ISO, and other styles
8

Klarman, Szymon, and Víctor Gutiérrez-Basulto. "Two-Dimensional Description Logics for Context-Based Semantic Interoperability." Proceedings of the AAAI Conference on Artificial Intelligence 25, no. 1 (2011): 215–20. http://dx.doi.org/10.1609/aaai.v25i1.7854.

Full text
Abstract:
Description Logics (DLs) provide a clear and broadly accepted paradigm for modeling and reasoning about terminological knowledge. However, it has been often noted, that although DLs are well-suited for representing a single, global viewpoint on an application domain, they offer no formal grounding for dealing with knowledge pertaining to multiple heterogeneous viewpoints — a scenario ever more often approached in practical applications, e.g. concerned with reasoning over distributed knowledge sources on the Semantic Web. In this paper, we study a natural extension of DLs, in the style of two-d
APA, Harvard, Vancouver, ISO, and other styles
9

Reznichenko, V. A., and O. V. Zakharova. "Description of the web service process. Tabular interpretation." PROBLEMS IN PROGRAMMING, no. 4 (December 2024): 99–113. https://doi.org/10.15407/pp2024.04.099.

Full text
Abstract:
Solving the tasks of web services at the process level is an actual problem for many years. This research is based on the previous ones, where the functional model of the web service and its tasks of this level are formalized by ontologies built on the basis of the descriptive logics. But the functional model is static and does not consider the behavior aspects of the web service. For a formalization of web service behavior, the descriptive logic should be extended by temporal operators. This is the focus of the research. To interpret temporal operators a tabular representation is used. This s
APA, Harvard, Vancouver, ISO, and other styles
10

Fernández-Duque, David, and Yoàv Montacute. "Dynamic Tangled Derivative Logic of Metric Spaces." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 9 (2024): 10509–16. http://dx.doi.org/10.1609/aaai.v38i9.28920.

Full text
Abstract:
Dynamical systems are abstract models of interaction between space and time. They are often used in fields such as physics and engineering to understand complex processes, but due to their general nature, they have found applications for studying computational processes, interaction in multi-agent systems, machine learning algorithms and other computer science related phenomena. In the vast majority of applications, a dynamical system consists of the action of a continuous `transition function' on a metric space. In this work, we consider decidable formal systems for reasoning about such struc
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Description logics with spatial operators"

1

GABRIELLI, Nicoletta. "Investigation of the tradeoff between expressiveness and complexity in description logics with spatial operators." Doctoral thesis, Università degli Studi di Verona, 2009. http://hdl.handle.net/11562/337448.

Full text
Abstract:
Le Logiche Descrittive sono una famiglia di formalismi molto espressivi per la rappresentazione della conoscenza. Questi formalismi sono stati investigati a fondo dalla comunità scientifica, ma, nonostante questo grosso interesse, sono state definite poche Description Logics con operatori spaziali e tutte centrate sul Region Connection Calculus. Nella mia tesi considero tutti i più importanti formalismi di Qualitative Spatial Reasoning per mereologie, mereo-topologie e informazioni sulla direzione e studio alcune tecniche generali di ibridazione. Nella tesi presento un’introduzione ai principa
APA, Harvard, Vancouver, ISO, and other styles
2

Lehmann, Jens. "Learning OWL Class Expressions." Doctoral thesis, Universitätsbibliothek Leipzig, 2010. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-38351.

Full text
Abstract:
With the advent of the Semantic Web and Semantic Technologies, ontologies have become one of the most prominent paradigms for knowledge representation and reasoning. The popular ontology language OWL, based on description logics, became a W3C recommendation in 2004 and a standard for modelling ontologies on the Web. In the meantime, many studies and applications using OWL have been reported in research and industrial environments, many of which go beyond Internet usage and employ the power of ontological modelling in other fields such as biology, medicine, software engineering, knowledge manag
APA, Harvard, Vancouver, ISO, and other styles
3

Wolter, Frank, and Michael Zakharyaschev. "On the Decidability of Description Logics with Modal Operators." 1998. https://ul.qucosa.de/id/qucosa%3A31937.

Full text
Abstract:
The paper considers the standard concept description language ALC augmented with various kinds of modal operators which can be applied to concepts and axioms. The main aim is to develop methods of proving decidability of the satisfiability problem for this language and apply them to description logics with most important temporal and epistemic operators, thereby obtaining satisfiability checking algorithms for these logics. We deal with the possible world semantics under the constant domain assumption and show that the expanding and varying domain assumptions are reducible to it. Models with b
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Description logics with spatial operators"

1

Sánchez-Ruiz, Antonio A., Santiago Ontañón, Pedro Antonio González-Calero, and Enric Plaza. "Measuring Similarity in Description Logics Using Refinement Operators." In Case-Based Reasoning Research and Development. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23291-6_22.

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

Peuter, Dennis, Viorica Sofronie-Stokkermans, and Sebastian Thunert. "On P-Interpolation in Local Theory Extensions and Applications to the Study of Interpolation in the Description Logics $$\mathcal{E}\mathcal{L}, \mathcal{E}\mathcal{L}^+$$." In Automated Deduction – CADE 29. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38499-8_24.

Full text
Abstract:
AbstractWe study the P-interpolation property for certain local theory extensions, and use these results for proving $$\le $$ ≤ -interpolation in classes of semilattices with monotone operators. For computing the $$\le $$ ≤ -interpolating terms, we use a hierarchic approach. We use these results for the study of $$\sqsubseteq $$ ⊑ -interpolation in the description logics $$\mathcal{E}\mathcal{L}$$ E L and $$\mathcal{E}\mathcal{L}^+$$ E L + .
APA, Harvard, Vancouver, ISO, and other styles
3

Troelstra, A. S. "Tutorial on Linear Logic." In Substructural Logics. Oxford University PressOxford, 1993. http://dx.doi.org/10.1093/oso/9780198537779.003.0013.

Full text
Abstract:
Abstract In this tutorial we present a very elementary introduction to linear logic, consisting of a description of the system, a sketch of cut-elimination, a discussion of the relationship with intuitionistic logic (embedding theorems), a sketch of completeness for algebraic semantics, and some remarks on the computational interpretation. From a technical point of view linear logic appears as a refinement of ordinary logic; in a sequential formulation in Gentzen-style this is obtained by omitting the rules of contraction and weakening (thinning); afterwards weakening and contraction are reint
APA, Harvard, Vancouver, ISO, and other styles
4

Hudelot Céline, Atif Jamal, and Bloch Isabelle. "Integrating Bipolar Fuzzy Mathematical Morphology in Description Logics for Spatial Reasoning." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2010. https://doi.org/10.3233/978-1-60750-606-5-497.

Full text
Abstract:
Bipolarity is an important feature of spatial information, involved in the expression of preferences and constraints about spatial positioning or in pairs of opposite spatial relations such as left and right. Another important feature is imprecision which has to be taken into account to model vagueness, inherent to many spatial relations (as for instance vague expressions such as close to, to the right of), and to gain in robustness in the representations. In previous works, we have shown that fuzzy sets and fuzzy mathematical morphology are appropriate frameworks, on the one hand, to represen
APA, Harvard, Vancouver, ISO, and other styles
5

Fanizzi, Nicola. "Concept Induction in Description Logics Using Information-Theoretic Heuristics." In Semantic Web. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-3610-1.ch005.

Full text
Abstract:
This paper presents an approach to ontology construction pursued through the induction of concept descriptions expressed in Description Logics. The author surveys the theoretical foundations of the standard representations for formal ontologies in the Semantic Web. After stating the learning problem in this peculiar context, a FOIL-like algorithm is presented that can be applied to learn DL concept descriptions. The algorithm performs a search through a space of candidate concept definitions by means of refinement operators. This process is guided by heuristics that are based on the available
APA, Harvard, Vancouver, ISO, and other styles
6

Cravero Maximiliano, de Bertrand de Beuvron François, Zanni-Merk Cecilia, and Marc-Zwecker Stella. "A Description Logics Geographical Ontology for Effective Semantic Analysis of Satellite Images." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2012. https://doi.org/10.3233/978-1-61499-105-2-1573.

Full text
Abstract:
The increasing availability of high spatial resolution satellite images is an opportunity to characterize and identify urban objects. Object-based approaches using domain knowledge for image analysis are necessary to classify data. A major issue in these approaches is domain knowledge formalization and exploitation. The use of formal ontologies seems a judicious choice to deal with these issues, and therefore, an ontology concerning urban objects has been developed. Description logics (DL) have been used to exploit the knowledge in the ontologies and develop software tools to assist the automa
APA, Harvard, Vancouver, ISO, and other styles
7

Sikder, Iftikhar U., and Santosh K. Misra. "Agent-Based Semantic Interoperability of Geo-Services." In Methodological Advancements in Intelligent Information Technologies. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-60566-970-0.ch007.

Full text
Abstract:
This chapter proposes a multi-agent based framework that allows multiple data sources and models to be semantically integrated for spatial modeling in business processing. The authros introduce a multiagent system (OSIRIS – Ontology-based Spatial Information and Resource Integration Services) to semantically interoperate complex spatial services and integrate them in a meaningful composition. The advantage of using multi-agent collaboration in OSIRIS is that it obviates the need for end-user analysts to be able to decompose a problem domain to subproblems or to map different models according t
APA, Harvard, Vancouver, ISO, and other styles
8

Tennant, Neil. "The Concept of Real Number." In The Logic of Number. Oxford University Press, 2022. http://dx.doi.org/10.1093/oso/9780192846679.003.0021.

Full text
Abstract:
This chapter lays the conceptual groundwork that is necessary by way of prelude to the technical work that is to be undertaken in Chapter 22, where logically precise axioms are framed governing the orderings of points on directed lines. Here it is explained how reference (and commitment) to reals arises from the re-carving of contents of statements of dimensional measurement in terms of a unit, and a notion of congruence (or equality-of- magnitude). Thus one speaks of a dimension D (e.g., length; duration), unit-of-D (e.g., meter; second), D* (e.g., long), #D (e.g., the length of; the duration
APA, Harvard, Vancouver, ISO, and other styles
9

Ferrin Giovanni, Snidaro Lauro, and Foresti Gian Luca. "Event Analysis and Understanding for Situational Awareness Support." In NATO Science for Peace and Security Series - D: Information and Communication Security. IOS Press, 2010. https://doi.org/10.3233/978-1-60750-621-8-139.

Full text
Abstract:
In this paper, we propose a framework for the assessment, interpretation and understanding of situations in a visual surveillance scenario. An upper level processing layer exploits abductive reasoning over data provided by low level detection, classification and tracking algorithms. The system discussed is Description Logics driven and benefits from the computability of first-order logic semantics together with the manageability characteristics of ontology based systems. Event occurrence frequency is taken into account to focus on &amp;ldquo;anomalous facts,&amp;rdquo; by combining a priori kn
APA, Harvard, Vancouver, ISO, and other styles
10

Puls, Stephan, and Heinz Wörn. "Seamless Interfacing." In Emerging Research and Trends in Interactivity and the Human-Computer Interface. IGI Global, 2014. http://dx.doi.org/10.4018/978-1-4666-4623-0.ch007.

Full text
Abstract:
Intuitive means of human-machine interaction are needed in order to facilitate seamless human-robot cooperation. Knowledge about human posture, whereabouts, and performed actions allows interpretation of the situation. Thus, expectations towards system behavior can be inferred. This work demonstrates a system in an industrial setting that combines all this information in order to achieve situation awareness. The continuous human action recognition is based on hierarchical Hidden Markov Models. For identifying and predicting human location, an approach based on potential functions is presented.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Description logics with spatial operators"

1

Wałęga, Przemysław Andrzej. "Expressive Power of Definite Descriptions in Modal Logics." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/65.

Full text
Abstract:
Motivated by applications in knowledge representation and reasoning, modal and description logics have been recently extended with definite description operators. Such operators provide us with a tool for referring to a particular element of a model by stating a property satisfied only by this element. This mechanism resembles the way we refer to objects in natural language, which makes it an attractive component of ontology and query languages. In this paper, we aim to provide a tool for analysing the expressive power of logics with definite descriptions. In particular, we introduce an adequa
APA, Harvard, Vancouver, ISO, and other styles
2

Lutz, Carsten, and Lukas Schulze. "Description Logics with Abstraction and Refinement: From ALC to EL." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/51.

Full text
Abstract:
We study extensions of description logics from the widely used EL family with operators that make it possible to speak about different levels of abstraction. We analyze the computational complexity of reasoning and show that often, this complexity is significantly lower than in the corresponding extension of the more expressive description logic ALC. By slightly varying the semantics, we also obtain a case that admits reasoning in polynomial time.
APA, Harvard, Vancouver, ISO, and other styles
3

Bienvenu, Meghyn, Camille Bourgaux, and Daniil Kozhemiachenko. "Queries With Exact Truth Values in Paraconsistent Description Logics." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/14.

Full text
Abstract:
We present a novel approach to querying classical inconsistent description logic (DL) knowledge bases by adopting a paraconsistent semantics with the four ‘Belnapian’ values: exactly true (T), exactly false (F), both (B), and neither (N). In contrast to prior studies on paraconsistent DLs, we allow truth value operators in the query language, which can be used to differentiate between answers having contradictory evidence and those having only positive evidence. We present a reduction to classical DL query answering that allows us to pinpoint the precise combined and data complexity of answeri
APA, Harvard, Vancouver, ISO, and other styles
4

Straccia, Umberto. "Towards spatial reasoning in fuzzy description logics." In 2009 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2009. http://dx.doi.org/10.1109/fuzzy.2009.5277056.

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

Lutz, Carsten, and Lukas Schulze. "Description Logics with Abstraction and Refinement." In 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/48.

Full text
Abstract:
Ontologies often require knowledge representation on multiple levels of abstraction, but description logics (DLs) are not well-equipped for supporting this. We propose an extension of DLs in which abstraction levels are first-class citizens and which provides explicit operators for the abstraction and refinement of concepts and roles across multiple abstraction levels, based on conjunctive queries. We prove that reasoning in the resulting family of DLs is decidable while several seemingly harmless variations turn out to be undecidable. We also pinpoint the precise complexity of our logics and
APA, Harvard, Vancouver, ISO, and other styles
6

Gutiérrez-Basulto, Víctor, and Jean Christoph Jung. "Combining DL-Lite_{bool}^N with Branching Time: A gentle Marriage." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/149.

Full text
Abstract:
We study combinations of the description logic DL-Lite_{bool}^N with the branching temporal logics CTL* and CTL. We analyse two types of combinations, both with rigid roles: (i) temporal operators are applied to concepts and to ABox assertions, and (ii) temporal operators are applied to concepts and Boolean combinations of concept inclusions and ABox assertions. For the resulting logics, we present algorithms for the satisfiability problem and (mostly tight) complexity bounds ranging from ExpTime to 3ExpTime.
APA, Harvard, Vancouver, ISO, and other styles
7

Fortin, Marie, Boris Konev, Vladislav Ryzhikov, Yury Savateev, Frank Wolter, and Michael Zakharyaschev. "Unique Characterisability and Learnability of Temporal Instance Queries." In 19th International Conference on Principles of Knowledge Representation and Reasoning {KR-2022}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/kr.2022/17.

Full text
Abstract:
We aim to determine which temporal instance queries can be uniquely characterised by a (polynomial-size) set of positive and negative temporal data examples. We start by considering queries formulated in fragments of propositional linear temporal logic LTL that correspond to conjunctive queries (CQs) or extensions thereof induced by the until operator. Not all of these queries admit polynomial characterisations, but by imposing a further restriction to path-shaped queries we identify natural classes that do. We then investigate how far the obtained characterisations can be lifted to temporal k
APA, Harvard, Vancouver, ISO, and other styles
8

Krasaki, Eirini. "Design as semiosis: A design mechanism for place branding." In International Conference on the 4th Game Set and Match (GSM4Q-2019). Qatar University Press, 2019. http://dx.doi.org/10.29117/gsm4q.2019.0035.

Full text
Abstract:
The described design methodology combines parametric design, data analysis, algorithmic design and semiotics theory to systematically analyze urban reality. The analysis leads to a creation of a nebula of data which corresponds to the place of interest. The nebula of data consists of networks of semiotics spatially defined. Through the proposed methodology, semiotics are used to enhance the perception that we have for a place and create a strategy for its' branding. Space is not approached as an empty container but as a complex system that consists of material and immaterial elements. The char
APA, Harvard, Vancouver, ISO, and other styles
9

Galliani, Pietro, Oliver Kutz, and Nicolas Troquard. "Succinctness and Complexity of ALC with Counting Perceptrons." In 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/29.

Full text
Abstract:
Perceptron operators have been introduced to knowledge representation languages such as description logics in order to define concepts by listing features with associated weights and by giving a threshold. Semantically, an individual then belongs to such a concept if the weighted sum of the listed features it belongs to reaches that threshold. Such operators have been subsequently applied to cognitively-motivated modelling scenarios and to building bridges between learning and reasoning. However, they suffer from the basic limitation that they cannot consider the weight or number of role fille
APA, Harvard, Vancouver, ISO, and other styles
10

Casasent, David, and Abhijit Mahalanobis. "Rule-Based, Probabilistic, Symbolic Target Classification by Object Segmentation." In Optical Computing. Optica Publishing Group, 1987. http://dx.doi.org/10.1364/optcomp.1987.tub3.

Full text
Abstract:
Optical symbolic processing applications in pattern recognition rather than logic operations [1,2] are considered in this paper. The database we employ is summarized in Section 2. Optical correlators represent one of the most powerful functions possible and preferable for realization on optical systems. We thus retain this architecture as the fundamental level-one symbolic processor to be used [2,3]. We utilize the attractive aspects of distortion-invariant iconic optical matched spatial filter (MSF) filters [4] in this work. We increase the flexibility, capacity and performance of such filter
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Description logics with spatial operators"

1

Lutz, Carsten. TheComplexity of Reasoning with Concrete Domains (Revised Version). Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.88.

Full text
Abstract:
Description logics are knowledge representation and reasoning formalisms which represent conceptual knowledge on an abstract logical level. Concrete domains are a theoretically well-founded approach to the integration of description logic reasoning with reasoning about concrete objects such as numbers, time intervals or spatial regions. In this paper, the complexity of combined reasoning with description logcis and on concrete domains is investigated. We extend ALC(D), which is the basic description logic for reasoning with concrete domains, by the operators 'feature agreement' and 'feature di
APA, Harvard, Vancouver, ISO, and other styles
2

Lutz, Carsten, and Frank Wolter. Modal Logics of Topological Relations. Technische Universität Dresden, 2004. http://dx.doi.org/10.25368/2022.142.

Full text
Abstract:
The eight topological RCC8(or Egenhofer-Franzosa)- relations between spatial regions play a fundamental role in spatial reasoning, spatial and constraint databases, and geographical information systems. In analogy with Halpern and Shoham’s modal logic of time intervals based on the Allen relations, we introduce a family of modal logics equipped with eight modal operators that are interpreted by the RCC8-relations. The semantics is based on region spaces induced by standard topological spaces, in particular the real plane. We investigate the expressive power and computational complexity of the
APA, Harvard, Vancouver, ISO, and other styles
3

Baader, Franz, Silvio Ghilardi, and Carsten Lutz. LTL over Description Logic Axioms. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.164.

Full text
Abstract:
Most of the research on temporalized Description Logics (DLs) has concentrated on the case where temporal operators can occur within DL concept descriptions. In this setting, reasoning usually becomes quite hard if rigid roles, i.e., roles whose interpretation does not change over time, are available. In this paper, we consider the case where temporal operators are allowed to occur only in front of DL axioms (i.e., ABox assertions and general concept inclusion axioms), but not inside of concepts descriptions. As the temporal component, we use linear temporal logic (LTL) and in the DL component
APA, Harvard, Vancouver, ISO, and other styles
4

Borgwardt, Stefan, Marcel Lippmann, and Veronika Thost. Reasoning with Temporal Properties over Axioms of DL-Lite. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.208.

Full text
Abstract:
Recently, a lot of research has combined description logics (DLs) of the DL-Lite family with temporal formalisms. Such logics are proposed to be used for situation recognition and temporalized ontology-based data access. In this report, we consider DL-Lite-LTL, in which axioms formulated in a member of the DL-Lite family are combined using the operators of propositional linear-time temporal logic (LTL). We consider the satisfiability problem of this logic in the presence of so-called rigid symbols whose interpretation does not change over time. In contrast to more expressive temporalized DLs,
APA, Harvard, Vancouver, ISO, and other styles
5

Borgwardt, Stefan, and Veronika Thost. Temporal Query Answering in DL-Lite with Negation. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.221.

Full text
Abstract:
Ontology-based query answering augments classical query answering in databases by adopting the open-world assumption and by including domain knowledge provided by an ontology. We investigate temporal query answering w.r.t. ontologies formulated in DL-Lite, a family of description logics that captures the conceptual features of relational databases and was tailored for efficient query answering. We consider a recently proposed temporal query language that combines conjunctive queries with the operators of propositional linear temporal logic (LTL). In particular, we consider negation in the onto
APA, Harvard, Vancouver, ISO, and other styles
6

Baader, Franz, Patrick Koopmann, and Anni-Yasmin Turhan. Using Ontologies to Query Probabilistic Numerical Data (Extended Version). Technische Universität Dresden, 2017. http://dx.doi.org/10.25368/2022.235.

Full text
Abstract:
We consider ontology-based query answering in a setting where some of the data are numerical and of a probabilistic nature, such as data obtained from uncertain sensor readings. The uncertainty for such numerical values can be more precisely represented by continuous probability distributions than by discrete probabilities for numerical facts concerning exact values. For this reason, we extend existing approaches using discrete probability distributions over facts by continuous probability distributions over numerical values. We determine the exact (data and combined) complexity of query answe
APA, Harvard, Vancouver, ISO, and other styles
7

Horrocks, Ian, Ulrike Sattler, and Stephan Tobies. A Description Logic with Transitive and Converse Roles, Role Hierarchies and Qualifying Number Restrictions. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.94.

Full text
Abstract:
As widely argued [HG97; Sat96], transitive roles play an important role in the adequate representation of aggregated objects: they allow these objects to be described by referring to their parts without specifying a level of decomposition. In [HG97], the Description Logic (DL) ALCHR+ is presented, which extends ALC with transitive roles and a role hierarchy. It is argued in [Sat98] that ALCHR+ is well-suited to the representation of aggregated objects in applications that require various part-whole relations to be distinguished, some of which are transitive. However, ALCHR+ allows neither the
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Description logics with spatial operators' 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