Disjunctive Logic Programs with Inheritance

The paper proposes a new knowledge representation language, called DLP<, which extends disjunctive logic programming (with strong negation) by inheritance. The addition of inheritance enhances the knowledge modeling features of the language providing a natural representation of default reasoning with exceptions. A declarative model-theoretic semantics of DLP< is provided, which is shown to generalize the Answer Set Semantics of disjunctive logic programs. The knowledge modeling features of the language are illustrated by encoding classical nonmonotonic problems in DLP<. The complexity of DLP< is analyzed, proving that inheritance does not cause any computational overhead, as reasoning in DLP< has exactly the same complexity as reasoning in disjunctive logic programming. This is confirmed by the existence of an efficient translation from DLP< to plain disjunctive logic programming. Using this translation, an advanced KR system supporting the DLP< language has been implemented on top of the DLV system and has subsequently been integrated into DLV.Comment: 28 pages; will be published in Theory and Practice of Logic Programmin

Nelson's paraconsistent logics

. David Nelson’s constructive logics with strong negation may be viewed as alternative paraconsistent logic. These logics have been developed before da Costa’s works. We address some philosophical aspects of Nelson’s logics and give technical results concerning Kripke models and tableau calculi. We also suggest possible applications of paraconsistent constructive logics

Logic Programming with Default, Weak and Strict Negations

This paper treats logic programming with three kinds of negation: default, weak and strict negations. A 3-valued logic model theory is discussed for logic programs with three kinds of negation. The procedure is constructed for negations so that a soundness of the procedure is guaranteed in terms of 3-valued logic model theory.Comment: 14 pages, to appear in Theory and Practice of Logic Programming (TPLP

Sustainability Reporting in Turkey: BIST Sustainability Index

Sustainability reporting is a corporate practice that includes environmental, social and governance aspects. It ensures that businesses are prepared for future risks, challenges, and opportunities. Additionally, sustainability reports can provide more information about company's performance. World practice shows that most companies follow the Global Reporting Initiative (GRI) when preparing their reports.Sustainability reporting in Turkey is done on a voluntary basis. Along with GRI, businesses use the BIST Sustainability Index to track company growth. The study focuses on examining the Turkish sustainability reporting reviews in the GRI and BIST Sustainability Index perspectives. Additionally, the research outlines benefits which sustainability reporting provides to enterprises.

Strong properties of circumscriptive logic programming

Dix [7, 5, 6] introduced a method for classifying semantics of normal logic programs. Some of these properties, called strong properties, are adaptations of properties from general nommonotonic theories. We apply this technique to circumscriptive logic programs [8, 9], an extension of traditional logic programming that incorporates circumscriptive policies in the programs. We show this approach preserves cumulativity, although it is not rational and supraclassical. This suggests circumscriptive logic programs have a correct behavior, maintaining properties from normal logic programsEje: Inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI

A three-valued logic for Inductive Logic Programming

Inductive Logic Programming (ILP) is closely related to Logic Programming (LP) by the name. We extract the basic differences of ILP and LP by comparing both and give definitions of the basic assumptions of their paradigms, e.g. closed world assumption, the open domain assumption and the open world assumption used in ILP. The paper is written in English

Extended full computation-tree logics for paraconsistent model checking

It is known that the full computation-tree logic CTL * is an important base logic for model checking. The bisimulation theorem for CTL* is known to be useful for abstraction in model checking. In this paper, the bisimulation theorems for two paraconsistent four-valued extensions 4CTL* and 4LCTL* of CTL* are shown, and a translation from 4CTL* into CTL* is presented. By using 4CTL* and 4LCTL*, inconsistency-tolerant and spatiotemporal reasoning can be expressed as a model checking framework

Belnap's epistemic states and negation-as-failure

Generalizing Belnap's system of epistemic states [Bel77] we obtain the system of disjunctive factbases which is the paradigm for all other kinds of disjunctive knowledge bases. Disjunctive factbases capture the nonmonotonic reasoning based on paraminimal models. In the schema of a disjunctive factbase, certain predicates of the resp. domain are declared to be exact, i.e. two-valued, and in turn some of these exact predicates are declared to be subject to the Closed-World Assumption (CWA). Thus, we distinguish between three kinds of predicates: inexact predicates, exact predicates subject to the CWA, and exact predicates not subject to the CWA

Strong properties of circumscriptive logic programming

Dix [7, 5, 6] introduced a method for classifying semantics of normal logic programs. Some of these properties, called strong properties, are adaptations of properties from general nommonotonic theories. We apply this technique to circumscriptive logic programs [8, 9], an extension of traditional logic programming that incorporates circumscriptive policies in the programs. We show this approach preserves cumulativity, although it is not rational and supraclassical. This suggests circumscriptive logic programs have a correct behavior, maintaining properties from normal logic programsEje: Inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI