Description logics refer to a family of formalisms concentrated around concepts, roles and individuals. They belong to the most frequently used knowledge representation formalisms and provide a logical basis to a variety of well known paradigms. The main reasoning tasks considered in the area of description logics are those reducible to subsumption. On the other hand, any knowledge representation system should be equipped with a more advanced reasoning machinery. Therefore in the current paper we make a step towards integrating description (...) logics with second-order reasoning. One of the important motivations behind introducing second-order formalism follows from the fact that many forms of commonsense and nonmonotonic reasoning used in AI can be modelled within the second-order logic. To achieve our goal we first extend description logics with a possibility to quantify over concepts. Since one of the main criticisms against the use of second-order formalisms is their complexity, we next propose second-order quantifier elimination techniques applicable to a large class of description logic formulas. Finally we show applications of the techniques, in particular in reasoning with circumscribed concepts and approximated terminological formulas. (shrink)

In the paper we present a technique for eliminating quantifiers of arbitrary order, in particular of first-order. Such a uniform treatment of the elimination problem has been problematic up to now, since techniques for eliminating first-order quantifiers do not scale up to higher-order contexts and those for eliminating higher-order quantifiers are usually based on a form of monotonicity w.r.t implication (set inclusion) and are not applicable to the first-order case. We make a shift to arbitrary relations “ordering” the underlying universe. (...) This allows us to incorporate background theories into higher-order quantifier elimination methods which, up to now, has not been achieved. The technique we propose subsumes many other results, including the Ackermann's lemma and various forms of fixpoint approaches when the “ordering” relations are interpreted as implication and reveals the common principle behind these approaches. (shrink)

The paper discusses properties of 4QL, a DATALOG⌉⌉-like query language, originally outlined by Maluszyński and Szalas (Maluszyński & Szalas, 2011). 4QL allows one to use rules with negation in heads and bodies of rules. It is based on a simple and intuitive semantics and provides uniform tools for “lightweight” versions of known forms of nonmonotonic reasoning. Negated literals in heads of rules may naturally lead to inconsistencies. On the other hand, rules do not have to attach meaning to some literals. (...) Therefore 4QL is founded on a four-valued semantics, employing the logic introduced in (Maluszyński et al., 2008; Vitória et al., 2009) with truth values: ‘true’, ‘false’, ‘inconsistent’ and ‘unknown’. In addition, 4QL is tractable w.r.t. data complexity and captures PTIME queries. Even though DATALOG⌉⌉ is known as a concept for the last 30 years, to our best knowledge no existing approach enjoys these properties.In the current paper we:investigate properties of well-supported models of 4QLprove the correctness of the algorithm for computing well-supported modelsshow that 4QL has PTIME data complexity and captures PTIME. (shrink)

In the current paper we consider theories with vocabulary containing a number of binary and unary relation symbols. Binary relation symbols represent labeled edges of a graph and unary relations represent unique annotations of the graph's nodes. Such theories, which we call annotation theories^ can be used in many applications, including the formalization of argumentation, approximate reasoning, semantics of logic programs, graph coloring, etc. We address a number of problems related to annotation theories over finite models, including satisfiability, querying problem, (...) specification of preferred models and model checking problem. We show that most of considered problems are NPTime- or co-NPTime-complete. In order to reduce the complexity for particular theories, we use second-order quantifier elimination. To our best knowledge none of existing methods works in the case of annotation theories. We then provide a new second-order quantifier elimination method for stratified theories, which is successful in the considered cases. The new result subsumes many other results, including those of [2, 28, 21]. (shrink)

Second-order quantifier elimination in the context of classical logic emerged as a powerful technique in many applications, including the correspondence theory, relational databases, deductive and knowledge databases, knowledge representation, commonsense reasoning and approximate reasoning. In the current paper we first generalize the result of Nonnengart and Szałas [17] by allowing second-order variables to appear within higher-order contexts. Then we focus on a semantical analysis of conditionals, using the introduced technique and Gabbay’s semantics provided in [10] and substantially using a (...) third-order accessibility relation. The analysis is done via finding correspondences between axioms involving conditionals and properties of the underlying third-order relation. (shrink)

This paper describes an experimental platform for approximate knowledge databases called the Approximate Knowledge Database, based on a semantics inspired by rough sets. The implementation is based upon the use of a standard SQL database to store logical facts, augmented with several query interface layers implemented in JAVA through which extensional, intensional and local closed world nonmonotonic queries in the form of crisp or approximate logical formulas can be evaluated tractably. A graphical database design user interface is also provided which (...) simplifies the design of databases, the entering of data and the construction of queries. The theory and semantics for AKDBs is presented in addition to application examples and details concerning the database implementation. (shrink)

Grammar logics were introduced by Fariñas del Cerro and Penttonen in 1988 and have been widely studied. In this paper we consider regular grammar logics with converse ( REG c logics) and present sound and complete tableau calculi for the general satisfiability problem of REG c logics and the problem of checking consistency of an ABox w.r.t. a TBox in a REG c logic. Using our calculi we develop ExpTime (optimal) tableau decision procedures for the mentioned problems, to which various (...) optimization techniques can be applied. We also prove a new result that the data complexity of the instance checking problem in REG c logics is coNP-complete. (shrink)

Mathematical theory of voting and social choice has attracted much attention. In the general setting one can view social choice as a method of aggregating individual, often conflicting preferences and making a choice that is the best compromise. How preferences are expressed and what is the “best compromise” varies and heavily depends on a particular situation. The method we propose in this paper depends on expressing individual preferences of voters and specifying properties of the resulting ranking by means of first-order (...) formulas. Then, as a technical tool, we use methods of second-order quantifier elimination to analyze and compute results of voting. We show how to specify voting, how to compute resulting rankings and how to verify voting protocols. (shrink)

Rough Sets were introduced by Z. Pawlak in the year 1982 with the intention to address knowledge representation and data processing from the angle of computation and decision making. The main idea...

In this paper we study automated reasoning in the modal logic CPDLreg which is a combination of CPDL (Propositional Dynamic Logic with Converse) and REGc (Regular Grammar Logic with Converse). The logic CPDL is widely used in many areas, including program verification, theory of action and change, and knowledge representation. On the other hand, the logic REGc is applicable in reasoning about epistemic states and ontologies (via Description Logics). The modal logic CPDLreg can serve as a technical foundation for reasoning (...) about agency. Even very rich multi-agent logics can be embedded into CPDLreg via a suitable translation. Therefore, CPDLreg can serve as a test bed to implement and possibly verify new ideas without providing specific automated reasoning techniques for the logic in question. This process can to a large extent be automated. The idea of embedding various logics into CPDLreg is illustrated on a rather advanced logic TEAMLOGK designed to specify teamwork in multi-agent systems. Apart from defining informational and motivational attitudes of groups of agents, TEAMLOGK allows for grading agents' beliefs, goals and intentions. The current paper is a companion to our paper (Dunin-Kęplicz et al., 2010a). The main contribution are proofs of soundness and completeness of the tableau calculus for CPDLreg provided in (Dunin-Kęplicz et al., 2010a). (shrink)

The famous theory of undecidable sentences created by Kurt Godel in 1931 is presented as clearly and as rigorously as possible. Introductory explanations beginning with the necessary facts of arithmetic of integers and progressing to the theory of representability of arithmetical functions and relations in the system (S) prepare the reader for the systematic exposition of the theory of Godel which is taken up in the final chapter and the appendix.

There are many religions in the human world, and people manifest their religiousness in many different ways. The main problem this paper addresses concerns the possibility of sorting out this complex world of human religiousness by showing that it can be phenomenologically reduced to a few very basic existential attitudes. These attitudes express the main types of ways in which a human being relates to his or herself and the world, independently of the worldview or religion professed by the individual. (...) I use Kierkegaard’s theories of the stages of existence and subjective truth as a model. The theory of the stages of existence provides five basic existential attitudes on the basis of which religious attitudes can develop: spiritlessness, the aesthetic, the ethical, religiousness A, and religiousness B. The theory of subjective truth shows how the concept of truth functions in an ethical and existential sense as the personal truth of an individual engaged in building their religious identity. In turn, I discuss the problem of the relation of Kierkegaard’s philosophy to phenomenology, briefly introduce his concept of subjective truth and the stages of existence, and show how existential attitudes can be transformed into religious ones. I also consider the problem of the demonic as the inverted order of this anthropological and existential model. Finally, I argue that the model developed herein may be useful for further research into the phenomenology of religious attitudes. (shrink)

In the paper, pre-Hilbert algebras are defined as a generalization of Hilbert algebras (namely, a Hilbert algebra is just a pre-Hilbert algebra satisfying the property of antisymmetry). Pre-Hilbert algebras have been inspired by Henkin's Positive Implicative Logic. Their properties and characterizations are investigated. Some important results and examples are given. Moreover, positive implicative pre-Hilbert algebras are introduced and studied, their connections with some algebras of logic are presented. The hierarchies existing between the classes of algebras considered here are shown.

In the article I consider Hume's arguments against miracles and the notion of miracle. From Hume's perspective, miracles are violations of the laws of nature caused by the supernatural being or beings. In Part I of On Miracles Hume argues that miracles can never be believed by a rational person. In Part II he attempts to demonstrate that there is actually no evidence for a miracle. Using distinction between laws of nature and scientific laws, and the deductive-nomological model of explanation, (...) I come to some conclusions. (shrink)

Książka stanowi wprowadzenie do twórczości Richarda Rorty'ego, a także próbę osadzenia jej na szerszym tle filozofii współczesnej, ze szczególnym uwzględnieniem filozofii postmodernistycznej. Obecne są w niej szersze analizy stanu kultury współczesnej, a także relacje z istotnych koncepcji obecnych we współczesnej humanistyce, bez których nie można zrozumieć ewolucji współczesnej humanistyki i specjalnej roli, jaką odegrała w niej filozofia Richarda Rorty'ego.

The paper consists of two parts, outlined in the title.I. In the historical science time appears as an element of the historian’s workshop. The historian collects source information, evaluates them and assigns respective dates. Only on the ground of thus “processed” sources may he reproduce the past: events and longer development processes, setting them in time. This dated time is understood colloquially as something objective, which runs one way and may be measured.II. A historian who studies the past reality depends (...) on the extent to which those sources are preserved. As a result of their interpretation, with the use of increasingly excellent research methods, he reproduces that reality. He must carry out an ongoing selection of historical facts found. This exposes him to temptations of such selection of those facts so as to adjust the historical knowledge to serve well the national interests, his own political opinions, etc. In this way the historian exerts influence on social awareness, which may consists of various myths and stereotypes, which sometimes lead to negative social behaviors: aggression, chauvinism, etc. Therefore, for researcher honesty’s sake and in the sense of moral responsibility, he must be careful to be as impartial as possible in his work. (shrink)

We classify two of Bertrand Russell's theories of events within the point-free ontology. The first of such approaches was presented informally by Russell in ‘The World of Physics and the World of Sense’ (Lecture IV in Our Knowledge of the External World of 1914). Based on this theory, Russell sketched ways to construct instants as collections of events. This paper formalizes Russell's approach from 1914. We will also show that in such a reconstructed theory, we obtain all axioms of Russell's (...) second theory from 1936 and all axioms of Thomason's theory of events from 1989. Russell's work certainly influenced the works of Stanisław Leśniewski, his student Alfred Tarski, and Czesław Lejewski – prominent members of the Lvov-Warsaw School (LWS). We see our work in the tradition of the research of Leśniewski and Tarski. Building on the technical tools developed in this environment and in the spirit of the traditional research of the LWS, we engage here, in particular, with two classic works by Russell on fundamental ontology. (shrink)

Dowód pierwszej tezy Gorgiasza jest dedukcyjnym wnioskowaniem nie wprost, skon-struowanym przez wielokrotne użycie schematu modus tollens. Te z jego przesłanek, które przyjęte są bez dowodów, są łudząco podobne do niektórych prawd logicznych lub analitycznych. Gdyby rzeczywiście nimi były, w dowodzie musiałyby pojawić się sprzeczności. W czasach Gorgiasza dowód mógł uchodzić za poprawny; możliwość jasnego wskazania i opisania jego defektów poja-wiła się dopiero z wynalezieniem logiki formalnej. Gorgiasz mógł ogłosić swą tezę serio –jako tezę skrajnego nihilizmu metafizycznego –nie obawiając się kompromitacji. (...) Jeżeli dowód jest sofizma-tem, to wśród sofizmatów jest arcydziełem, najwybitniejszym osiągnięciem sofistów w tej dziedzi-nie. (shrink)

In this paper, we want to present the genesis of Stanisław Leśniewski’s mereology. Although ‘mereology’ comes from theword ‘part’, mereology arose as a theory of collective classes. That is why we present the differences between the concepts of being a distributive class and being a collective class. Next, we present Leśniewski’s original mereology from 1927, but with a modern approach. Leśniewski was inspired to create his concept of classes and their elements by Russell’s antinomy. To face it, Leśniewski had to (...) define the concept of being an element of based on the concept of being part of. Leśniewski showed that in his theory, there is no equivalent to Russell’s antinomy. We will show that his solution has nothing to do with the original approach because, in both cases, we are talking about objects of a different kind. Russell’s original antinomy concerned distributive classes, and Leśsniewski’s considerations concerned collective classes. (shrink)