scholarly journals Finite Open-World Query Answering with Number Restrictions

2015 ◽  
Author(s):  
Antoine Amarilli ◽  
Michael Benedikt
Keyword(s):  
Query Answering ◽  
Open World

scholarly journals Temporal Query Answering in DL-Lite with Negation

10.29007/2df8 ◽  
2018 ◽  
Author(s):  
Stefan Borgwardt ◽  
Veronika Thost
Keyword(s):  
Temporal Logic ◽  
Domain Knowledge ◽  
Relational Databases ◽  
Query Language ◽  
Description Logics ◽  
Query Answering ◽  
Open World ◽  
Temporal Query ◽  
Temporal Query Language ◽  
Open World Assumption

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 ontology and query language, and study both data and combined complexity of query entailment.

scholarly journals Finite Open-world Query Answering with Number Restrictions

2020 ◽  
Vol 21 (4) ◽  
pp. 1-73
Author(s):  
Antoine Amarilli ◽  
Michael Benedikt
Keyword(s):  
Query Answering ◽  
Open World

scholarly journals Enhancing Existential Rules by Closed-World Variables

2018 ◽  
Author(s):  
Giovanni Amendola ◽  
Nicola Leone ◽  
Marco Manna ◽  
Pierfrancesco Veltri
Keyword(s):  
Computational Complexity ◽  
Query Answering ◽  
Open World ◽  
Closed World ◽  
Open World Assumption ◽  
Existential Quantification

Existential rules generalize Datalog with existential quantification in the head. Natively, Datalog is interpreted under a closed-world semantics, while existential rules typically employ the open-world assumption. The interpretation domain in the latter case is enlarged by infinitely many "anonymous" individuals. Then, in any rule, each variable ranges over all individuals, even if not needed or required. In this paper, we enhance existential rules by closed-world variables to consciously reason on the properties of "known" (non-anonymous) and arbitrary individuals in different ways. Accordingly, we uniformly generalize the basic classes of existential rules that ensure decidability of ontology-based query answering. For them, after observing that decidability is preserved, we prove that a strict increase in expressiveness is gained, and in most cases the computational complexity is not altered.

Computing Cores for Existential Rules with the Standard Chase and ASP

2020 ◽  
Author(s):  
Markus Krötzsch
Keyword(s):  
Large Class ◽  
Data Exchange ◽  
Answer Set Programming ◽  
Query Answering ◽  
Universal Model ◽  
The Core ◽  
Universal Models ◽  
General Terms ◽  
Special Cases ◽  
The Many

To reason with existential rules (a.k.a. tuple-generating dependencies), one often computes universal models. Among the many such models of different structure and cardinality, the core is arguably the “best”. Especially for finitely satisfiable theories, where the core is the unique smallest universal model, it has advantages in query answering, non-monotonic reasoning, and data exchange. Unfortunately, computing cores is difficult and not supported by most reasoners. We therefore propose ways of computing cores using practically implemented methods from rule reasoning and answer set programming. Our focus is on cases where the standard chase algorithm produces a core. We characterise this desirable situation in general terms that apply to a large class of cores, derive concrete approaches for decidable special cases, and generalise these approaches to non-monotonic extensions of existential rules.

The Unified World Order

2014 ◽  
Vol 31 (2) ◽  
pp. 75-100
Author(s):  
Bakare Adewale Muteeu
Keyword(s):  
Cultural Values ◽  
International System ◽  
World Order ◽  
Social Injustice ◽  
World Peace ◽  
Technological Determinism ◽  
Open World ◽  
The World ◽  
Capitalist World ◽  
The Rich

In pursuit of a capitalist world configuration, the causal phenomenon of globalization spread its cultural values in the built international system, as evidenced by the dichotomy between the rich North and the poor South. This era of cultural globalization is predominantly characterized by social inequality, economic inequality and instability, political instability, social injustice, and environmental change. Consequently, the world is empirically infected by divergent global inequalities among nations and people, as evidenced by the numerous problems plaguing humanity. This article seeks to understand Islam from the viewpoint of technological determinism in attempt to offset these diverging global inequalities for its “sociopolitical economy”1existence, as well as the stabilization of the interconnected world. Based upon the unifying view of microIslamics, the meaning of Islam and its globalizing perspectives are deciphered on a built micro-religious platform. Finally, the world is rebuilt via the Open World Peace (OWP) paradigm, from which the fluidity of open globalization is derived as a future causal phenomenon for seamlessly bridging (or contracting) the gaps between the rich-rich, rich-poor, poor-rich and poor-poor nations and people based on common civilization fronts.

Island Generator pada Game Open world Menggunakan Algoritma Perlin noise

Repositor ◽  
2020 ◽  
Vol 2 (7) ◽  
pp. 965
Author(s):  
Naufal Azzmi ◽  
Lailatul Husniah ◽  
Ali Sofyan Kholimi
Keyword(s):  
Performance Testing ◽  
Game Development ◽  
Procedural Content Generation ◽  
Open World ◽  
Game World ◽  
Perlin Noise ◽  
And Performance ◽  
Game Developers ◽  
Pcg Method ◽  
Content Generation

AbstrakPerkembangan game pada saat ini berkembang dengan sangat cepat, dalam perkermbangan game topik AI adalah topik yang paling banyak diteliti oleh beberapa peneliti khususnya pada pembuatan suatu konten game menggunakan metode PCG (procedural content generation). Pada pembuatan sebuah game world menggunakan metode PCG sudah banyak developer game yang sukses dengan mengimplementasikan metode ini, metode ini banyak digunkan pada geme dengan genre RPG, Rouglikes, Platformer, SandBox, Simulation dan lain sebagainya, Pada penelitian ini berfokus pada pengembangan sebuah game world generator untuk game berjenis open world yang berupa sebuah kepulauan dengan metode PCG dengan menggunakan algoritma perlin noise sebagai algoritma pembentuk textur utama pulau yang dimana pada penelitian ini memanfaatkan beberapa variable noise seperti octave, presistance dan lacunarity guna untuk menambah kontrol dari hasil textur yang dihasilkan serta algoritma penempatan pulau untuk membuat sebuah game world yang menyerupai sebuah kepulauan. Dari hasil uji generator terkait degan pengujian playability dan performa dapat disimpulkan bahwa generator yang dikembangkan playable serta performa yang dianaliasa menggunakan notasi Big O menunjukkan  (linear). Abstract Game development is currently growing very fast, game development AI is the most discussed topic by most researchers especially in the developing of game content using the PCG (procedural content generation) method. In making a game world using the PCG method, many game developers have succeeded by implementing this method, this method is widely used on RPGs, Rouglikes, Platformers, SandBox, Simulations and ect,. This study focuses on developing a game world generator game for open world type games in the form of an archipelago using the PCG method using the noise perlin algorithm as the island's main texturizing algorithm which in this study utilizes several noise variables such as octave, presistance and use for add control of the texture results as well as the island placement algorithm’s to create a game world that resembles an archipelago form. From the generator test results related to the playability and performance testing, it shows that map are being generated by the generators are playable and performance that are analyzed using Big O notation show O (n) (linear).

An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆

2021 ◽  
Vol 178 (4) ◽  
pp. 315-346
Author(s):  
Domenico Cantone ◽  
Marianna Nicolosi-Asmundo ◽  
Daniele Francesco Santamaria
Keyword(s):  
Semantic Web ◽  
Set Theory ◽  
Description Logic ◽  
Knowledge Bases ◽  
Query Answering ◽  
Conjunctive Query ◽  
Classification Problems ◽  
Previous Version ◽  
Decidable Fragment ◽  
Stratified Set

We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic 𝒟ℒ〈4LQSR,×〉(D) (𝒟ℒD4,×, for short). Our application solves the main TBox and ABox reasoning problems for 𝒟ℒD4,×. In particular, it solves the consistency and the classification problems for 𝒟ℒD4,×-knowledge bases represented in set-theoretic terms, and a generalization of the Conjunctive Query Answering problem in which conjunctive queries with variables of three sorts are admitted. The reasoner, which extends and improves a previous version, is implemented in C++. It supports 𝒟ℒD4,×-knowledge bases serialized in the OWL/XML format and it admits also rules expressed in SWRL (Semantic Web Rule Language).

Sign in / Sign up

Export Citation Format

Share Document