Results 31 to 40 of about 130,323 (314)
Transforming Fuzzy Description Logics into Classical Description Logics [PDF]
, 2004 In this paper we consider Description Logics (DLs), which are logics for managing structured knowledge, with a well-known fuzzy extension to deal with vague information. While for fuzzy DLs ad-hoc, tableaux-like reasoning procedures have been given in the literature, the topic of this paper is to present a reasoning preserving transformation of fuzzy ...
openaire +3 more sources
Interpretations of Prices by Russian Consumers: From Trust in State to Economic Autonomy
Интеракция. Интервью. Интерпретация, 2020 On the data of 63 in-depth interviews conducted in crisis 2014–2017 and post-crisis 2018–2019 and analyzed in the framework of sociological cognitivism and the new economic sociology, the article reconstructs semantic logics being used by Russian ...
Elena Sergeevna Berdysheva
doaj +1 more source
Information systems modelling based on graph-theoretic background
Journal of Information and Telecommunication, 2018 The recent tendency in analysis and design of information systems is that the emphasis is placed on the documents that are ubiquitous around information systems and organizations.
B. Molnár, A. Béleczki, A. Benczúr
doaj +1 more source
Cut-Simulation and Impredicativity [PDF]
Logical Methods in Computer Science, 2009 We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for classical type ...
Christoph Benzmueller +2 more
doaj +1 more source
A Rational Entailment for Expressive Description Logics via Description Logic Programs [PDF]
, 2022 Lehmann and Magidor's rational closure is acknowledged as a landmark in the field of non-monotonic logics and it has also been re-formulated in the context of Description Logics (DLs). We show here how to model a rational form of entailment for expressive DLs, such as SROIQ, providing a novel reasoning procedure that compiles a non-monotone DL ...
Casini G, Straccia U
openaire +5 more sources
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures [PDF]
Logical Methods in Computer ScienceWe introduce the class of tree constraint automata with data values in Z (equipped with the less than relation and equality predicates to constants) and we show that the nonemptiness problem is ExpTime-complete.
Stephane Demri, Karin Quaas
doaj +1 more source
Incoherency Problems in a Combination of Description Logics and Rules
Journal of Applied Mathematics, 2014 A paraconsistent semantics has been presented for hybrid MKNF knowledge bases—a combination method for description logics and rules. However, it is invalid when incoherency occurs in the knowledge base. In this paper, we introduce a semi-S5 semantics for
Shasha Huang, Jing Hao, Dang Luo
doaj +1 more source
Practical Reasoning for Very Expressive Description Logics
, 1999 Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones.
Horrocks, Ian +2 more
core +6 more sources
Моделирование и анализ информационных систем, 2021 Sequential reactive systems are computer programs or hardware devices which process the flows of input data or control signals and output the streams of instructions or responses.
Anton Romanovich Gnatenko +1 more
doaj +1 more source
FaCT++ Description Logic Reasoner: System Description [PDF]
, 2006 This is a system description of the Description Logic reasoner FaCT++. The reasoner implements a tableaux decision procedure for the well known SHOIQ description logic, with additional support for datatypes, including strings and integers. The system employs a wide range of performance enhancing optimisations, including both standard techniques (such ...
Tsarkov, Dmitry, Horrocks, Ian
openaire +2 more sources