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)

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)

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)

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)

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)

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)

W ostatnich latach obserwujemy intensywną debatę publiczną dotyczącą implementacji koncepcji miast i gmin przyjaznych starzeniu się (age-friendly cities and communities) oraz jej nowszej i szerszej odsłony związanej z inteligentnymi i zdrowymi przestrzeniami przyjaznymi starzeniu się (smart healthy age-friendly environments, SHAFE). Rozdział koncentruje się na zwięzłym przeglądzie obejmującym te zagadnienia. W pierwszej części artykuł przybliża podstawowe pojęcia i wybrane działania Komisji Europejskiej w obszarze upowszechniania dialogu międzypokoleniowego oraz programowania polityk relacji międzypokoleniowych. Następnie zaprezentowano krótkie omówienia studiów przypadku dotyczące wybranych projektów innowacji (...) społecznych i metodyk mających na celu: (1) wzmocnienie pozycji facylitatorów koncepcji miast i gmin przyjaznych starzeniu się oraz inteligentnych, zdrowych i inkluzywnych przestrzeni; (2) ułatwienie obywatelom, szczególnie osobom starszym, radzenia sobie z sytuacjami kryzysowymi w obszarze zdrowia publicznego; oraz (3) wspieranie głosu seniorów i seniorek w podejmowaniu decyzji co do celów i zadań polityk publicznych (współprojektowanie), ich wdrażania (współzarządzanie, współrealizowanie/koprodukcja usług publicznych) oraz ich monitorowania i ewaluacji (współocena). Ostatnia część zawiera rekomendacje dla wybranych podmiotów odpowiedzialnych za politykę publiczną wobec starzenia się ludności oraz propozycje kierunków dalszych badań. (shrink)

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)

Podstawowym założeniem artykułu jest uznanie, że złożoność wyzwań związanych ze starzeniem się populacji wymusza rozwój powiązań kooperacyjnych między podmiotami polityki publicznej reprezentującymi różne sektory. Innymi słowy: niezbędna jest bardziej intensywna i lepiej skoordynowana współpraca między organizacjami sektora publicznego, komercyjnego, pozarządowego, nieformalnego oraz sektora obejmującego podmioty gospodarki społecznej (np. spółdzielnie). Zasadnicze znaczenie ma w tym kontekście wdrażanie założeń teorii współzarządzania (governance), koprodukcji oraz mieszanej gospodarki dobrobytu (inaczej: wielosektorowej polityki społecznej). W konsekwencji artykuł wskazuje na wybrane wątki dyskursu dotyczącego relacji procesu starzenia (...) się ludności z przedsiębiorczością społeczną i innowacjami społecznymi. Tekst przytacza także przykłady dobrych praktyk i inicjatyw z obszaru gospodarki społecznej. Podsumowanie zawiera rekomendacje dla podmiotów polityki publicznej oraz proponowane kierunki dalszych badań. (shrink)

The book deals with post-analytical philosophy of law, which departs from the traditional view which considers philosophical cognition as a sense-making and optimizing activity. It seeks to deconstruct the analytical, both philosophical and legal, narrative to expose it as a collection of schemes which oversimplify the legal and political reality.

Das Buch ist eine systematische Bearbeitung der neukantischen Philosophie und enthält einen Überblick über die wichtigsten Vertreter aller sieben neukantianischen Richtungen und Schulen: physiologische, metaphysische, relativistische, psychologische, realistische, so wie auch Badische Schule und Marburger Schule.

There is a long-lasting controversy concerning our mind and consciousness. The book proposes a connection between the mind the brain and the multiverse. We introduce the main philosophical ideas concerning mind and freedom. Explain the basic principles of computer science, artificial intelligence of brain research, quantum physics and quantum artificial intelligence. We indicate how we can provide an answer to the problem of the mind and consciousness by describing the nature of the physical world. Our proposed explanation includes the Everett (...) Many-worlds theory. The book tries to avoid any non-essential metaphysical speculations. The book is an essential compilation of knowledge in philosophy, computer science, biology, and quantum physics. It is written for readers without any requirements in mathematics, physics, or computer science. (shrink)

Celem badań jest odpowiedź na pytanie o to, jakie są efekty dotychczasowej realizacji warsztatów typu medialab z inicjatywy Fundacji Ortus w Polsce oraz jakie są uwarunkowania ich dalszego rozwoju w kierunku budowy stałej instytucji. Podjęta analiza została ukierunkowana na osiągnięcie następujących celów teoretycznych i praktycznych: identyfikacja cech wizerunku warsztatów medialab organizowanych przez Fundację Ortus; określenie zakresu upowszechniania w Polsce koncepcji nowych instytucji kultury poprzez warsztaty medialab; określenie opinii i postaw wobec inicjatyw medialab ich uczestników i nie-uczestników; identyfikacja zakresu wykorzystania technik (...) i form działań poznanych na warsztatach medialab przez ich uczestników; oszacowanie trwałości zawiązanych między uczestnikami warsztatów więzi i zakresu współpracy przez wspólnych przedsięwzięciach; identyfikacja dotychczasowych i potencjalnych korzyści i barier w realizacji inicjatyw medialab; ustalenie czynników wspierających i hamujących przyszłą działalność instytucji medialab w stałej lokalizacji; określenie cech potencjalnej roli instytucji medialab w regionalnej polityce kulturalnej i polityce innowacji; wskazanie potencjalnych rozwiązań na rzecz budowy polskiego modelu instytucji medialab. (shrink)