Complexity results for the default- and the autoepistemic logic

2005 ◽  
pp. 339-352
Author(s):  
Eckhard Steffen
Keyword(s):  
Autoepistemic Logic ◽  
Complexity Results

Concern, Respect, and Cooperation

2018 ◽  
Author(s):  
Garrett Cullity
Keyword(s):  
Moral Theory ◽  
Fundamental Principle ◽  
Simple Set ◽  
Collective Activity ◽  
Complexity Results ◽  
Concern For Others ◽  
Moral Theories ◽  
Moral Responsibilities

Three things often recognized as central to morality are concern for others’ welfare, respect for their self-expression, and cooperation in worthwhile collective activity. When philosophers have proposed theories of the substance of morality, they have typically looked to one of these three sources to provide a single, fundamental principle of morality—or they have tried to formulate a master-principle for morality that combines these three ideas in some way. This book views them instead as three independently important foundations of morality. It sets out a plural-foundation moral theory with affinities to that of W. D. Ross. There are major differences: the account of the foundations of morality differs from Ross’s, and there is a more elaborate explanation of how the rest of morality derives from them. However, the overall aim is similar. This is to illuminate the structure of morality by showing how its complex content is generated from a relatively simple set of underlying elements—the complexity results from the various ways in which one part of morality can derive from another, and the various ways in which the derived parts of morality can interact. Plural-foundation moral theories are sometimes criticized for having nothing helpful to say about cases in which their fundamental norms conflict. Responding to this, the book concludes with three detailed applications of the theory: to the questions surrounding paternalism, the use of others as means, and our moral responsibilities as consumers.

scholarly journals More on Modal Aspects of Default Logic1

1992 ◽  
Vol 17 (1-2) ◽  
pp. 99-116
Author(s):  
V. Wiktor Marek ◽  
Miroslaw Truszczynski
Keyword(s):  
Modal Logic ◽  
Default Logic ◽  
Nonmonotonic Logic ◽  
Default Reasoning ◽  
Default Theory ◽  
Autoepistemic Logic ◽  
The Relationship ◽  
Natural Classes ◽  
Weak Extension

Investigations of default logic have been so far mostly concerned with the notion of an extension of a default theory. It turns out, however, that default logic is much richer. Namely, there are other natural classes of objects that might be associated with default reasoning. We study two such classes of objects with emphasis on their relations with modal nonmonotonic formalisms. First, we introduce the concept of a weak extension and study its properties. It has long been suspected that there are close connections between default and autoepistemic logics. The notion of weak extension allows us to precisely describe the relationship between these two formalisms. In particular, we show that default logic with weak extensions is essentially equivalent to autoepistemic logic, that is, nonmonotonic logic KD45. In the paper we also study the notion of a set of formulas closed under a default theory. These objects are shown to correspond to stable theories and to modal logic S5. In particular, we show that skeptical reasoning with sets closed under default theories is closely related with provability in S5. As an application of our results we determine the complexity of reasoning with weak extensions and sets closed under default theories.

Formalization of Inheritance Reasoning in Autoepistemic Logic

1990 ◽  
Vol 13 (4) ◽  
pp. 403-443
Author(s):  
Michael Gelfond ◽  
Halina Przymusinska
Keyword(s):  
General Framework ◽  
Nonmonotonic Reasoning ◽  
Commonsense Reasoning ◽  
Autoepistemic Logic

Current research in the area of nonmonotonic reasoning suggests that autoepistemic logic provides a general framework for formalizing commonsense reasoning in various domains of discourse. The goal of this paper is to investigate the suitability of autoepistemic logic for formalization of some forms of inheritance reasoning. To this end we propose a new semantics for inheritance networks with exceptions based on autoepistemic logic.

Roman {k}-domination in trees and complexity results for some classes of graphs

2021 ◽  
Author(s):  
Cai-Xia Wang ◽  
Yu Yang ◽  
Hong-Juan Wang ◽  
Shou-Jun Xu
Keyword(s):  
Complexity Results

A compendium of parameterized complexity results

1994 ◽  
Vol 25 (3) ◽  
pp. 122-123 ◽  
Author(s):  
Michael T. Hallett ◽  
H. Todd Wareham
Keyword(s):  
Parameterized Complexity ◽  
Complexity Results

Reflexive Autoepistemic Logic

1992 ◽  
Vol 17 (1-2) ◽  
pp. 157-173
Author(s):  
Grigori Schwarz
Keyword(s):  
Autoepistemic Logic ◽  
New Variant ◽  
Formal Properties

We propose a new variant of autoepistemic logic which, intuitively, corresponds to understanding a belief operator L as “is known”, in contrast to the interpretation of L as “is believed” in Moore’s autoepistemic logic. Formal properties of the new logic and relationship to Moore’s logic are studied in detail.

scholarly journals Bounds and complexity results for strong edge colouring of subcubic graphs

2011 ◽  
Vol 38 ◽  
pp. 463-468
Author(s):  
Hervé Hocquard ◽  
Pascal Ochem ◽  
Petru Valicov
Keyword(s):  
Complexity Results ◽  
Subcubic Graphs ◽  
Edge Colouring
Sign in / Sign up

Export Citation Format

Share Document